Complexity of some problems concerning varieties and quasi-varieties of algebras

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 359-382

  Bergman, Clifford ^a   Slutzki, Giora ^b  

^a IOWA STATE UNIVERSITY   (United States)

^b Iowa State University   (United States)

Author keywords

Clone; Computational complexity; Hyperexponential time; Logarithmic space; Nondeterminism; Polynomial space; Quasi variety; Term equivalence; Variety

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; SPECIFICATIONS;

HYPEREXPONENTIAL TIME; QUASI-VARIETIES;

ALGEBRA;

EID: 0342468143     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798345944     Document Type: Article

References (33)

1. C. BERGMAN, D. JUEDES, AND G. SLUTZKI, Computational complexity of term-equivalence, Internat. J. Algebra Comput., 9 (1999), pp. 113-128.
2. J. BERMAN, A proof of Lyndon's finite basis theorem, Discrete Math., 29 (1980), pp. 229-233.
3. G. BIRKHOFF, On the structure of abstract algebras, Proc. Cambr. Philos. Soc., 31 (1935), pp. 433-454.
4. S. BURRIS, Computers and universal algebra: some directions, Algebra Universalis, 34 (1995), pp. 61-71.
5. S. BURRIS AND H. P. SANKAPPANAVAR, A Course in Universal Algebra, Springer-Verlag, New York, 1981.
6. H. EHRIG AND B. MAHR, Fundamentals of Algebraic Specification 1, EATCS Monographs on Theoretical Computer Science 6, Springer-Verlag, Berlin, 1985.
7. R. FREESE AND R. MCKENZIE, Commutator Theory for Congruence Modular Varieties, London Math. Soc. Lecture Notes Ser. 125, Cambridge University Press, Cambridge, UK, 1987.
8. H. FRIEDMAN, Function Composition and Intractability I, Manuscript, 1982.
9. M. GAREY AND D. JOHNSON, Computers and Intractability - A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, CA, 1979.
10. G. GRÄTZER, Universal Algebra, 2nd ed., Springer-Verlag, New York, 1979.
11. Z. HEDRLÍN AND A. PULTR, On full embeddings of categories of algebras, Illinois J. Math., 10 (1966), pp. 392-405.
12. N. IMMERMAN, Nondeterministic space is closed under complementation, SIAM J. Comput., 17 (1988), pp. 935-938.
13. D. JOHNSON, A catalog of complexity classes, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 69-161.
14. J. KALICKI, On comparison of finite algebras, Proc. Amer. Math. Soc., 3 (1952), pp. 36-40.
15. K. KEARNES AND Á. SZENDREI, A characterization of minimal locally finite varieties, Trans. Amer. Math. Soc., 349 (1997), pp. 1749-1768.
16. J. KÖBLER, U. SCHÖNING, AND J. TORÁN, The Graph Isomorphism Problem: Its Structural Complexity, Birkhäuser Boston, Cambridge, MA, 1993.
17. D. KOZEN, Complexity of finitely presented algebras, in Proceedings of the Ninth Annual Symposium on the Theory of Computing, ACM, New York, 1977, pp. 164-177.
18. D. KOZEN, Lower bounds for natural proof systems, in 18th Annual Symposium on Foundations of Computer Science, Providence, RI, IEEE Computer Society, Los Alamitos, CA, 1977, pp. 254-266.
19. L. KUČERA AND V. TRNKOVÁ, The computational complexity of some problems in universal algebra, in Universal Algebra and its Links with Logic, Algebra, Combinatorics and Computer Science, P. Burmeister et al., eds., Heldermann Verlag, Berlin, 1984, pp. 261-289.
20. R. MCKENZIE, G. MCNULTY, AND W. TAYLOR, Algebras, Lattices, Varieties, I, Wadsworth and Brooks/Cole, Monterey, CA, 1987.
21. G. L. MILLER, Graph isomorphism: General remarks, J. Comput. System Sci., 18 (1979), pp. 128-142.
22. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
23. N. PIPPENGER, Theories of Computability, Cambridge University Press, Cambridge, UK, 1997.
24. E. POST, Two-Valued Iterative Systems of Mathematical Logic, Princeton University Press, Princeton, NJ, 1941.
25. D. SANELLA AND A. TARLECKI, On observational equivalence and algebraic specification, J. Comput. System Sci., 34 (1987), pp. 150-178.
26. W. J. SAVITCH, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 4 (1970), pp. 177-192.
27. M. SIPSER, Introduction to the Theory of Computation, PWS Publishing Company, Boston, MA, 1997.
28. Z. SZÉKELY, Complexity of the Finite Algebra Membership Problem for Varieties, Ph.D. thesis, University of South Carolina, Columbia, SC, 1998.
29. R. SZELEPCSÉNYI, The method of forced enumeration for nondeterministic automata, Acta Inform., 26 (1988), pp. 279-284.
30. Á. SZENDREI, Clones in Universal Algebra, Séminaire de Mathématiques Supérieures, L'Université de Montréal, Montréal, Canada, 1986.
31. W. TAYLOR, Equational logic, Houston J. Math. Survey, (1979), pp. iii+83.
32. I. WEGENER, The Complexity of Boolean Functions, John Wiley and Sons, Chichester, UK, 1987.
33. J. WING, A specifier's introduction to formal methods, Computer, 23 (1990), pp. 8-24.