Computational complexity of solving equation systems

DOI10.1007/978-3-319-21750-5zbMATH Open1321.12001OpenAlexW2309062621MaRDI QIDQ2947434FDOQ2947434

Authors: Przemyslaw Broniek 

Publication date: 23 September 2015

Published in: SpringerBriefs in Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21750-5

Recommendations

• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Solving equations over small unary algebras
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• On solvability of systems of polynomial equations
• On complexity of the satisfiability problem of systems over finite posets

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Research exposition (monographs, survey articles) pertaining to field theory (12-02)

Cited In (4)

• Title not available (Why is that?)
• Complexity of Solving Linear Systems in Different Models of Computation
• Satisfiability in MultiValued Circuits
• THE TYPE SET OF A VARIETY IS NOT COMPUTABLE

This page was built for publication: Computational complexity of solving equation systems

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