The NP-completeness column: An ongoing guide

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

On the Shannon capacity of a graph

László Lovász · IEEE Transactions on Information Theory · 1979 · 1.7K citations

Computing, Computer Science, Mathematics +8

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

Computing, Computer Science, Mathematics +15

Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

T. P. Baker, John Gill, Robert M Solovay · SIAM Journal on Computing · 1975 · 738 citations

Computing, Computer Science, Algorithms +10

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 659 citations

Computing, Computer Science, Artificial Intelligence +4