The equational theory of a nontrivial discriminator variety is co-NP-hard (Q2577705)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2243854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The equational theory of a nontrivial discriminator variety is co-NP-hard |
scientific article; zbMATH DE number 2243854 |
Statements
The equational theory of a nontrivial discriminator variety is co-NP-hard (English)
0 references
6 January 2006
0 references
The main result in the paper is that the equational theory of any non-trivial discriminator variety is co-NP-hard. The proof is based on efficient reduction of distributive lattice equations to equations in the target discriminator variety, and on a result by \textit{P. A. Bloniarz, H. B. Hunt III} and \textit{D. J. Rosenkrantz} [``Algebraic structures with hard equivalence and minimization problems'', J. Assoc. Comput. Mach. 31, 879--904 (1984; Zbl 0628.68039)] proving that a certain set of lattice equations true in distributive lattices is co-NP-hard.
0 references
equational theory
0 references
discriminator variety
0 references
complexity
0 references
0.84303653
0 references
0.8396859
0 references
