Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
Data up to Jan 2025
Total Citations Per Year
Abstract
References (15)
An Introduction to Numerical Analysis
1990 • 3,099 citations
Applied and Computational Complex Analysis
1977 • 2,127 citations
Analytic function theory
1959 • 965 citations
The Art of Computer Programming, Vol. 2
1981 • 887 citations
Solution of equations in Euclidean and Banach spaces
1973 • 689 citations
A General Theory of Optimal Algorithms
1980 • 615 citations
The numerical treatment of a single nonlinear equation
1970 • 530 citations
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
1975 • 409 citations
The fundamental theorem of algebra and complexity theory
1981 • 362 citations
Fast Algorithms for Manipulating Formal Power Series
1978 • 293 citations
Constructive Aspects of the Fundamental Theorem of Algebra
1972 • 157 citations
On Algorithms for Solving f(x)=0
1979 • 128 citations
The Problem of the Average Speed of the Simplex Method
1983 • 87 citations
Computational complexity. On the geometry of polynomials and a theory of cost. I
1985 • 68 citations
Complexity of linear programming
1982 • 60 citations