TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
2006 ◽
Vol 16
(03)
◽
pp. 563-581
◽
Keyword(s):
We study the algorithmic complexity of determining whether a system of polynomial equations over a finite algebra admits a solution. We characterize, within various families of algebras, which of them give rise to an NP-complete problem and which yield a problem solvable in polynomial time. In particular, we prove a dichotomy result which encompasses the cases of lattices, rings, modules, quasigroups and also generalizes a result of Goldmann and Russell for groups [15].
2007 ◽
Vol 17
(04)
◽
pp. 821-835
◽
2005 ◽
Vol DMTCS Proceedings vol. AF,...
(Proceedings)
◽
2010 ◽
Vol 20
(08)
◽
pp. 1001-1020
◽
2008 ◽
Vol 17
(03)
◽
pp. 349-371
◽
Keyword(s):
2010 ◽
Vol Vol. 12 no. 1
(Graph and Algorithms)
◽
Keyword(s):
2015 ◽
Vol 9
(2)
◽
pp. 357-366
◽
Keyword(s):
2015 ◽
Vol 25
(04)
◽
pp. 283-298
Keyword(s):
2020 ◽
Vol 40
(4)
◽
pp. 1008-1019