External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems

Kellogg S. Booth. Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems. SIAM Journal on Computing, 7(3):273-279, 1978.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on