SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS

DOI10.1142/S0218196707003809MaRDI QIDQ5386972zbMATH OpenFDO

Authors L. Zádori

Publication date 14 May 2008

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

zbMATH Keywords

complexityconstraint satisfactionvarietiesfinite algebrassystems of polynomial equations

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Congruence modularity, congruence distributivity (08B10) Sets with a single binary operation (groupoids) (20N02) Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70)

Recommendations

• On solvability of systems of polynomial equations
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Dichotomies in the complexity of solving systems of equations over finite semigroups
• The equation solvability problem over supernilpotent algebras with Mal’cev term
• The complexity of solving equations over finite groups

Cites work

• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Self-Rectangulating Varieties of Type 5
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• The Complexity of the Extendibility Problem for Finite Posets
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The complexity of solving equations over finite groups
• The structure of finite algebras
• Unary polynomials in algebras. I
• Varieties Obeying Homotopy Laws

Cited in

(6)

• Solvability of bivariate polynomial systems under perturbation
• On solvability of systems of polynomial equations
• Computational complexity of solving equation systems
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Automata, Languages and Programming
• The equation solvability problem over supernilpotent algebras with Mal’cev term

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386972)