Complexity theory and numerical analysis

1997/01/01 by Steve Smale · 1 citation
Mathematics · Computer Science · #Advanced Optimization Algorithms Research #Graph theory and applications #Matrix Theory and Algorithms

paper · doi:10.1017/s0962492900002774

openalex publication_date 1997/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/19

Abstract

Complexity theory of numerical analysis is the study of the number of arithmetic operations required to pass from the input to the output of a numerical problem.

Citations

• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• The Approximation of One Matrix by Another of Lower Rank
• Lower bounds for algebraic decision trees
• Straight-line programs in geometric elimination theory

Cited by

• Computational complexity theory [wikipedia]