|
833
|
Reducibility among Combinatorial Problems
– Karp
- 1972
|
|
515
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
496
|
The complexity of theorem-proving procedures
– Cook
- 1971
|
|
310
|
Nondeterministic exponential time has two-prover interactive protocols
– Babai, Fortnow, et al.
- 1991
|
|
232
|
Algebraic methods for interactive proof systems
– Lund, Fortnow, et al.
- 1992
|
|
172
|
NP is as easy as detecting unique solutions
– Valiant, Vazirani
- 1986
|
|
158
|
On isomorphism and density of NP and other complete sets
– Berman, Hartmanis
- 1977
|
|
135
|
Complexity measures for public-key cryptosystems
– Grollman, Selman
- 1988
|
|
125
|
Bounded query classes
– Wagner
- 1990
|
|
120
|
A Complexity Theoretic Approach to Randomness
– Sipser
- 1983
|
|
119
|
Matching is as easy as matrix inversion
– Mulmuley, Vazirani, et al.
- 1987
|
|
44
|
On truth-table reducibility to SAT
– Buss, Hay
- 1991
|
|
42
|
The role of relativization in complexity theory
– Fortnow
- 1994
|
|
41
|
Polynomial Reducibilities and Complete Sets
– Berman
- 1977
|
|
36
|
On relativized exponential and probabilistic complexity classes
– Heller
- 1986
|
|
32
|
The isomorphism conjecture holds relative to an oracle
– Fenner, Fortnow, et al.
- 1992
|
|
30
|
Two queries
– Buhrman, Fortnow
- 1996
|
|
30
|
Separability and one-way functions
– Fortnow, Rogers
- 1994
|
|
30
|
Oracles for structural properties: The isomorphism problem and public-key cryptography
– Homer, Selman
- 1992
|
|
28
|
The structure of complete degrees
– Kurtz, Mahaney, et al.
- 1990
|
|
22
|
Resource Bounded Reductions
– Buhrman, Spaan, et al.
- 1993
|
|
21
|
Structural Properties of The Counting Hierarchies
– Tor'an
- 1988
|
|
18
|
Resource-bounded Kolmogorov complexity revisited
– Buhrman, Fortnow
- 1997
|
|
15
|
Self-reducibility: Effects of internal structure on computational complexity
– Joseph, Young
- 1990
|
|
13
|
Six hypotheses in search of a theorem
– Buhrman, Fortnow, et al.
- 1997
|
|
11
|
Degree complexity of Boolean functions and its applications to relativized separations
– Tarui
- 1991
|
|
9
|
On isolating an odd number of elements and its applications to complexity theory
– Gupta
- 1993
|
|
9
|
Relativized polynomial hierarchies extending two levels
– Heller
- 1984
|
|
7
|
The complexity of generating and checking proofs of membership
– Buhrman, Thierauf
- 1996
|
|
7
|
A note on many-one and 1-truth table complete sets
– Homer, Kurtz, et al.
- 1993
|
|
6
|
Relativized questions involving probablistic algorithms
– Rackoff
- 1982
|
|
2
|
Sparse sets in NP\GammaP: Relativizations
– Kurtz
- 1985
|
|
