Computational complexity of solving equation systems

DOI10.1007/978-3-319-21750-5MaRDI QIDQ2947434zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(4)

• scientific article; zbMATH DE number 6146470 (Why is no real title available?)
• 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)