Polynomial complexity of solving systems of few algebraic equations with small degrees

DOI10.1007/978-3-319-02297-0_11MaRDI QIDQ5168466zbMATH OpenOpenAlexFDO

Authors Dima Grigoriev

Publication date 7 July 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02297-0_11

zbMATH Keywords

polynomial complexitysmall degreessolving systems of few equations

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Solving systems of algebraic equations
• On the complexity exponent of polynomial system solving
• Automata, Languages and Programming
• An improvement of the complexity bound for solving systems of polynomial equations
• scientific article; zbMATH DE number 4212207

Cited in

(7)

• Solvability of systems of polynomial congruences modulo a large prime
• An improvement of the complexity bound for solving systems of polynomial equations
• An effective construction of a small number of equations defining an algebraic variety
• Complexity of solving systems with few independent monomials and applications to mass-action kinetics
• Finding All Solutions to a System of Polynomial Equations
• scientific article; zbMATH DE number 1354139 (Why is no real title available?)
• scientific article; zbMATH DE number 1567790 (Why is no real title available?)

This page was built for publication: Polynomial complexity of solving systems of few algebraic equations with small degrees

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