Structure preserving reductions among convex optimization problems

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

Computing, Computer Science, Mathematics +17

Approximation algorithms for combinatorial problems

David S. Johnson · Journal of Computer and System Sciences · 1974 · 2.2K citations

Natural Sciences, Computer Science, Mathematics +12

P-Complete Approximation Problems

Sartaj Sahni, Teofilo F. Gonzalez · Journal of the ACM · 1976 · 1.7K citations · Full text

Natural Sciences, Computer Science, Mathematics +17

Algorithms for Scheduling Independent Tasks

Sartaj Sahni · Journal of the ACM · 1976 · 593 citations · Full text

Computing, Computer Science, Operations Management +13

The Complexity of Near-Optimal Graph Coloring

M. R. Garey, David S. Johnson · Journal of the ACM · 1976 · 326 citations · Full text

Computing, Computer Science, Mathematics +16