The complexity of promise problems with applications to public-key cryptography

On the Structure of Polynomial Time Reducibility

Richard E. Ladner · Journal of the ACM · 1975 · 790 citations · Full text

Computing, Computer Science, Algorithms +5

A comparison of polynomial time reducibilities

Richard E. Ladner, Nancy Lynch, Alan L. Selman · Theoretical Computer Science · 1975 · 414 citations

Computing, Computer Science, Mathematics +10

The complexity of facets (and some facets of complexity)

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1984 · 314 citations

Computing, Computer Science, Mathematics +10

Relative complexity of checking and evaluating

Leslie G. Valiant · Information Processing Letters · 1976 · 281 citations

Computing, Computer Science, Algorithms +11

Relativized Questions Involving Probabilistic Algorithms

Charles Rackoff · Journal of the ACM · 1982 · 84 citations · Full text

Natural Sciences, Computer Science, Mathematics +6