On the complexity of finite sorted algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1761 LNAI, Issue , 2000, Pages 95-108

  De La Tour, Thierry Boy ^a  

^a INPG IMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; THEOREM PROVING;

FINITE ALGEBRAS; GRAPH ISOMORPHISM PROBLEM; ISOMORPHISM PROBLEMS;

SET THEORY;

EID: 84867783914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46508-1_6     Document Type: Conference Paper

References (4)

1. M. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, California, 1979.
2. C. Hoffmann. Group-theoretic algorithms and graph isomorphism. Lecture Notes in Computer Science 136. Springer Verlag, 1981.
3. Dexter Kozen. Complexity of finitely presented algebras. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 164-177, Boulder, Colorado, 2-4 May 1977.
4. Gary L. Miller. Graph isomorphism, general remarks. Journal of Computer and System Sciences, 18:128-142, 1979.