On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 350-370
- https://doi.org/10.1137/0218024
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Complexity of quantifier elimination in the theory of algebraically closed fieldsPublished by Springer Nature ,2005
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- On the worst-case arithmetic complexity of approximating zeros of polynomialsJournal of Complexity, 1987
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex PolynomialsMathematics of Operations Research, 1987
- Resolution des systemes d'equations algebriquesTheoretical Computer Science, 1981
- Some Formulae in EliminationProceedings of the London Mathematical Society, 1902