SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS

DOI10.1142/S0218196707003809zbMath1145.08002MaRDI QIDQ5386972

László Zádori

Publication date: 14 May 2008

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

zbMATH Keywords

complexitysystems of polynomial equationsvarietiesconstraint satisfactionfinite algebras

Mathematics Subject Classification ID

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) Congruence modularity, congruence distributivity (08B10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Sets with a single binary operation (groupoids) (20N02)

Related Items (1)

On solvability of systems of polynomial equations

Cites Work

• Unnamed Item
• Unary polynomials in algebras. I
• The complexity of solving equations over finite groups
• The structure of finite algebras
• Varieties Obeying Homotopy Laws
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Self-Rectangulating Varieties of Type 5
• The Complexity of the Extendibility Problem for Finite Posets
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS

This page was built for publication: SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS