Results 301 to 303 of about 42,222 (303)
Some of the next articles are maybe not open access.
Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
SIAM Journal on Computing, 1978exaly
On the isomorphism-complete problems and polynomial time isomorphism
Acta Cybern., 1981openaire +2 more sources