A 2EXPTIME Complete Varietal Membership Problem

We construct a finite algebra generating a variety with 2EXPTIME complete membership problem. This proves that the universal membership problem for varieties and the varietal equivalence problem are 2EXPTIME complete as well, answering the question of Bergman and Slutzki from 2000.

[1]  Ralph McKenzie,et al.  Interpreting Graph Colorability in Finite Semigroups , 2006, Int. J. Algebra Comput..

[2]  Ralph McKenzie.  The Residual Bound of a Finite Algebra is not Computable , 1996, Int. J. Algebra Comput..

[3]  R. Kruse.  Identities satisfied by a finite ring , 1973 .

[4]  Zoltán Székely.  Computational Complexity of The Finite Algebra Membership Problem for Varieties , 2002, Int. J. Algebra Comput..

[5]  M. Kozik,et al.  The subdirectly irreducible algebras in the variety generated by graph algebras , 2008 .

[6]  R. McKenzie,et al.  On some complexity problems in finite algebras , 2004 .

[7]  Marcin Kozik.  Computationally and Algebraically Complex Finite Algebra Membership Problems , 2007, Int. J. Algebra Comput..

[8]  Mark V. Sapir,et al.  Algorithmic Problems in Varieties , 1995, Int. J. Algebra Comput..

[9]  Giora Slutzki,et al.  Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras , 2000, SIAM J. Comput..

[10]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[11]  Identical Relations in Finite Lie Rings , 1975 .

[12]  Ralph McKenzie.  The Residual Bounds of Finite Algebras , 1996, Int. J. Algebra Comput..

[13]  M. Powell,et al.  Identical relations in finite groups , 1964 .

[14]  J. Kalicki.  On comparison of finite algebras , 1952 .

[15]  Ralph McKenzie.  Equational Bases for Lattice Theories. , 1970 .

[16]  G. McNulty,et al.  Algebras, Lattices, Varieties , 1988, Mathematical Surveys and Monographs.