TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS

DOI10.1142/S021819671000600XzbMath1214.68176MaRDI QIDQ3067781

T. A. Gorazd, Jacek Krzaczkowski

Publication date: 13 January 2011

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

computational complexitysatisfiabilityuniversal algebraclones

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items

Loosely-abelian algebras ⋮ Satisfiability in MultiValued Circuits ⋮ Even Faster Algorithms for CSAT Over supernilpotent Algebras. ⋮ Evaluation of polynomials over finite rings via additive combinatorics ⋮ The complexity of the equivalence and equation solvability problems over meta-abelian groups

Cites Work

• On the algebraic structure of combinatorial problems
• The complexity of solving equations over finite groups
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)