Complexity of Bézout’s theorem. I. Geometric aspects

The Approximation of One Matrix by Another of Lower Rank

Carl Eckart, Gale Young · Psychometrika · 1936 · 3.8K citations

Computing, Data Science, Markov Decision Processes +9

Rounding errors in algebraic processes

Journal of the Franklin Institute · 1964 · 1.3K citations

Computing, Computer Science, Mathematics +12

Pathways to Solutions, Fixed Points, and Equilibria.

R. Bruce Kellogg, C. B. Garcia, Willard I. Zangwill · Mathematics of Computation · 1983 · 583 citations

Natural Sciences, Mathematics, Complex Systems +11

The fundamental theorem of algebra and complexity theory

Steve Smale · Bulletin of the American Mathematical Society · 1981 · 366 citations · Full text

Natural Sciences, Computer Science, Mathematics +16

Definability and fast quantifier elimination in algebraically closed fields

Joos Heintz · Theoretical Computer Science · 1983 · 319 citations

Natural Sciences, Computer Science, Mathematics +12