Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
- 1 August 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (3) , 273-279
- https://doi.org/10.1137/0207023
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The graph isomorphism diseaseJournal of Graph Theory, 1977
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975