Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras

@article{Bergman2000ComplexityOS,
  title={Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras},
  author={Clifford Bergman and Giora Slutzki},
  journal={SIAM J. Comput.},
  year={2000},
  volume={30},
  pages={359-382}
}
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B satisfy precisely the same identities? (2) Do they satisfy the same quasi-identities? (3) Do A and B have the same set of term operations? In addition to the general case in which we allow arbitrary (finite) algebras, we consider each of these problems under the restrictions that all operations are unary and that A… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Complexity of Finitely Presented Algebras

STOC • 1977
View 3 Excerpts
Highly Influenced

On full embeddings of categories of algebras

Z. Hedrĺın, A. Pultr
Illinois J. Math., 10 • 1966
View 3 Excerpts
Highly Influenced

Relationships Between Nondeterministic and Deterministic Tape Complexities

J. Comput. Syst. Sci. • 1970
View 3 Excerpts
Highly Influenced

A characterization of minimal locally finite varieties

K. Kearnes, Á. Szendrei
Trans. Amer. Math. Soc., 349 • 1997

Computers and universal algebra: some directions

S. Burris
Algebra Universalis, 34 • 1995
View 1 Excerpt

Similar Papers

Loading similar papers…