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

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.