ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
Publication:3621430
DOI10.1142/S0218196709004956zbMath1172.08004OpenAlexW1963602153MaRDI QIDQ3621430
Ralph Freese, Matthew A. Valeriote
Publication date: 21 April 2009
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196709004956
free algebratame congruence theorycongruence modularityidempotent algebrapolynomial-time algorithmsMal'tsev conditionscongruence distributivitycongruence permutableEXPTIME-complete
Analysis of algorithms and problem complexity (68Q25) Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10)
Related Items (27)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing congruences efficiently
- Congruence modularity is permutability composed with distributivity
- A characterization of congruence permutable locally finite varieties
- Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
- Varieties whose congruences satisfy certain lattice identities
- Congruence permutable and congruence 3-permutable locally finite varieties
- On \(n\)-permutable congruences
- A Characterization of Identities Implying Congruence Modularity I
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
- FINDING TYPE SETS IS NP-HARD
- The structure of finite algebras
- Modularity prevents tails
- The Relationship Between Two Commutators
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- Algebras Whose Congruence Lattices are Distributive.
- A Characterization of Modularity for Congruence Lattices of Algebras*
- A modification of Polin's variety
This page was built for publication: ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS