The equational theory of a nontrivial discriminator variety is co-NP-hard

DOI10.1007/s00012-004-1894-9zbMath1090.08007OpenAlexW2070486197MaRDI QIDQ2577705

Stanley N. Burris

Publication date: 6 January 2006

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-004-1894-9

zbMATH Keywords

complexitydiscriminator varietyequational theory

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Equational logic, Mal'tsev conditions (08B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices

This page was built for publication: The equational theory of a nontrivial discriminator variety is co-NP-hard