On the complexity of some basic problems in computational convexity: I. Containment problems

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

A new polynomial-time algorithm for linear programming

Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations

Natural Sciences, Computer Science, Algorithms +12

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA · 1981 · 2K citations

Natural Sciences, Mathematics, Algorithms +8

Polynomial algorithms in linear programming

Leonid Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1980 · 2K citations

Computing, Computer Science, Mathematics +10