A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)
KeywordsComplete Lattice Homomorphic Image Unary Algebra Simple Semigroup Graph Isomorphism
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- L. Babai: Moderately exponential bound for graph isomorphism, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 34–50.Google Scholar
- K. S. Booth, Ch. J. Colbourn: Problems polynomially equivalent to graph isomorphism, Tech. Rep. CS-77-04, Univ. of Waterloo, 1979.Google Scholar
- L. Kučera, V. Trnková: Isomorphism completeness for some algebraic structures, FCT 81, Lecture Notes in Comp. Sci. 117, Springer 1981, 218–225.Google Scholar
© Springer-Verlag Berlin Heidelberg 1982