A lower bound for solvability of polynomial equations

DOI10.1007/3-540-57529-4_60MaRDI QIDQ4268453zbMATH OpenFDO

Authors Ketan D. Mulmuley

Publication date 31 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57529-4_60

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Polynomial complexity of solving systems of few algebraic equations with small degrees
• Lower bounds for parallel linear programming and other problems
• When polynomial equation systems can be ``solved fast?
• Automata, Languages and Programming

Cited in

(3)

• The Complexity of Solving Polynomial Equations by Quadrature
• scientific article; zbMATH DE number 3860383 (Why is no real title available?)
• Lower bounds for a polynomial in terms of its coefficients

This page was built for publication: A lower bound for solvability of polynomial equations

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