SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS

DOI10.1142/S0218196707003809zbMATH Open1145.08002MaRDI QIDQ5386972FDOQ5386972

Authors: L. Zádori 

Publication date: 14 May 2008

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

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

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)

Cites Work

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

Cited In (5)

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

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)