On solvability of systems of polynomial equations

DOI10.1007/s00012-011-0128-1zbMath1228.08001OpenAlexW1968606578MaRDI QIDQ539980

László Zádori

Publication date: 1 June 2011

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-011-0128-1

zbMATH Keywords

computational complexitysystems of polynomial equationsfinite algebrasdichotomy theoremHobby-McKenzie typesolvability problem

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 (2)

STWS approach for Hammerstein system of nonlinear Volterra integral equations of the second kind ⋮ Satisfiability in MultiValued Circuits

Cites Work

• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited
• Bounded width problems and algebras
• Existence theorems for weakly symmetric operations
• On the algebraic structure of combinatorial problems
• The complexity of solving equations over finite groups
• Dichotomies for classes of homomorphism problems involving unary functions
• Tractable Clones of Polynomials over Semigroups
• Finitely Many Primitive Positive Clones
• 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
• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS

This page was built for publication: On solvability of systems of polynomial equations