Complexity of Bezout's theorem V: polynomial time

Theoretical Computer Science

Volumn 133, Issue 1, 1994, Pages 141-164

  Shub, M ^a   Smale, S ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; POLES AND ZEROS;

APPROXIMATE ZERO; ARITHMETIC OPERATIONS; BEZOUTS THEOREM; POLYNOMIAL TIME;

POLYNOMIALS;

EID: 0028516294     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90122-8     Document Type: Article

References (19)

1. On a theory of computation and complexity over the real numbers NP-completeness Recursive functions and Universal Machines
2. A weak version of the Blum, Shub and Smale model
3. On the complexity of path-following Newton algorithms for solving systems of polynomial equations with integer coefficients
4. Geometric Measure Theory
5. On properties of floating point arithmetics: numerical stability and cost of accurate computations
6. On the work of Steve Smale on the theory of computation
7. Computational complexity, on the geometry of polynomials and a theory of cost: Part II
8. Complexity of Bezout's theorem I: Geometric aspects
9. Complexity of Bezout's theorem II: Volumes and probabilities
10. Complexity of Bezout's theorem III: Condition number and packing
11. The fundamental theorem of algebra and complexity theory
12. Algorithms for solving equations
13. Some remarks on the foundations of numerical analysis
14. The Kinematic Formula in Riemannian Homogeneous Spaces