The extended equivalence and equation solvability problems for groups
Authors: Gabor Horvath 1; Csaba Szabo 2
NULL##NULL
Gabor Horvath;Csaba Szabo
1 Institute of Mathematics [Debrecen]
2 Department of Algebra and Number Theory [Budapest]
We prove that the extended equivalence problem is solvable in polynomial time for finite nilpotent groups, and coNP-complete, otherwise. We prove that the extended equation solvability problem is solvable in polynomial time for finite nilpotent groups, and NP-complete, otherwise.
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term
1 Document citing this article
Source : OpenCitations
Idziak, PaweĹ M.; Krzaczkowski, Jacek, 2018, Satisfiability In Multi-Valued Circuits, Proceedings Of The 33Rd Annual ACM/IEEE Symposium On Logic In Computer Science, 10.1145/3209108.3209173.