Polynomial-time tests for difference terms in idempotent varieties
From MaRDI portal
Abstract: We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.
Recommendations
Cites work
- A finite basis theorem for difference-term varieties with a finite residual bound
- A Subalgebra Intersection Property for Congruence Distributive Varieties
- Computational complexity of various Mal'cev conditions
- Computing congruences efficiently
- scientific article; zbMATH DE number 4035895 (Why is no real title available?)
- scientific article; zbMATH DE number 139656 (Why is no real title available?)
- Idempotent n-permutable varieties.
- Modularity prevents tails
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
- Simpler Maltsev conditions for (weak) difference terms in locally finite varieties
- The Relationship Between Two Commutators
- The shape of congruence lattices
- The structure of finite algebras
- Varieties having Boolean factor congruences
- Varieties with a difference term
Cited in
(4)
This page was built for publication: Polynomial-time tests for difference terms in idempotent varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237442)