1. ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS.
- Author
-
FREESE, RALPH and VALERIOTE, MATTHEW A.
- Subjects
ALGEBRA ,MATHEMATICS ,POLYNOMIALS ,ALGORITHMS ,FOUNDATIONS of arithmetic - Abstract
This paper studies the complexity of determining if a finite algebra generates a variety that satisfies various Maltsev conditions, such as congruence distributivity or modularity. For idempotent algebras we show that there are polynomial time algorithms to test for these conditions but that in general these problems are EXPTIME complete. In addition, we provide sharp bounds in terms of the size of two-generated free algebras on the number of terms needed to witness various Maltsev conditions, such as congruence distributivity. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF