ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
From MaRDI portal
Recommendations
Cites work
- A characterization of congruence permutable locally finite varieties
- A Characterization of Identities Implying Congruence Modularity I
- A Characterization of Modularity for Congruence Lattices of Algebras*
- A modification of Polin's variety
- Algebras Whose Congruence Lattices are Distributive.
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
- Computing congruences efficiently
- Congruence modularity is permutability composed with distributivity
- Congruence permutable and congruence 3-permutable locally finite varieties
- FINDING TYPE SETS IS NP-HARD
- scientific article; zbMATH DE number 139656 (Why is no real title available?)
- Modularity prevents tails
- On \(n\)-permutable congruences
- Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
- Tame congruence theory
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- The Relationship Between Two Commutators
- The structure of finite algebras
- Varieties whose congruences satisfy certain lattice identities
Cited in
(41)- Mal'cev conditions revisited
- The Jónsson distributivity spectrum
- Simpler Maltsev conditions for (weak) difference terms in locally finite varieties
- Testing for a semilattice term
- On the complexity of the Leibniz hierarchy
- Finite algebras of finite complexity
- Representability types of varieties and Mal'tsev strict conditions
- Mal'tsev condition satisfaction problems for conditions which imply edge terms
- Mitschke's theorem is sharp
- The Gumm level equals the Alvin level in congruence distributive varieties
- The Tschantz and the Alvin higher conditions are equivalent in congruence distributive varieties
- Existence of cube terms in finite algebras
- Optimal Mal'tsev conditions for congruence modular varieties
- Deciding absorption
- Computational complexity of various Mal'cev conditions
- On optimal strong Mal'cev conditions for congruence meet-semidistributivity in a locally finite variety
- On the CSP Dichotomy Conjecture
- scientific article; zbMATH DE number 437419 (Why is no real title available?)
- A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
- The computational complexity of deciding whether a finite algebra generates a minimal variety
- \(n\)-permutability and linear Datalog implies symmetric Datalog
- Hardness results for the subpower membership problem
- Maltsev conditions for general congruence meet-semidistributive algebras
- Universal algebraic methods for constraint satisfaction problems
- THE DISTRIBUTIVITY SPECTRUM OF BAKER’S VARIETY
- Maltsev families of varieties closed under join or Maltsev product
- Local–global property for G-invariant terms
- Deciding the existence of minority terms
- DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS
- Constant-query testability of assignments to constraint satisfaction problems
- Polynomial-time tests for difference terms in idempotent varieties
- Learnability of solutions to conjunctive queries
- Idempotent n-permutable varieties.
- Deciding the existence of quasiweak near unanimity terms in finite algebras
- Strong subalgebras and the constraint satisfaction problem
- Between an n-ary and an n + 1-ary near-unanimity term
- Some applications of higher commutators in Mal'cev algebras
- Relative lengths of Maltsev conditions
- Index set complexity for congruence lattices of lattices
- Horn sentences with (W) and weak Mal'cev conditions
- Conservative constraint satisfaction re-revisited
This page was built for publication: ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621430)
