Mathematics, Computer Science
Journal or Book Title
SIAM Journal on Computing
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 and B have cardinality two. We briefly discuss the relationship of these problems to algebraic specification theory.
Society for Industrial and Applied Mathematics
Bergman, Clifford and Slutzki, Giora, "Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras" (2000). Mathematics Publications. 3.