|
158
|
Almost Everywhere High Nonuniform Complexity
– Jack H. Lutz
- 1992
|
|
51
|
Almost Every Set in Exponential Time is P-Bi-Immune
– Elvira Mayordomo
- 1994
|
|
327
|
Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems
– Silvio Micali
- 1991
|
|
893
|
The knowledge complexity of interactive proof systems
– Shafi Goldwasser, Silvio Micali, Charles Rackoff
- 1989
|
|
280
|
Arthur–Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes
– L Babai, S Moran
- 1988
|
|
41
|
Measure, Stochasticity, and the Density of Hard Languages
– Jack H. Lutz, Elvira Mayordomo
- 1994
|
|
52
|
Cook versus Karp-Levin: Separating Completeness Notions If NP Is Not Small
– Jack H. Lutz, Elvira Mayordomo
- 1992
|
|
45
|
The Complexity and Distribution of Hard Problems
– David W. Juedes, Jack H. Lutz
- 1993
|
|
356
|
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols
– Laszlo Babai, Lance Fortnow, Carsten Lund
|
|
250
|
Hardness vs. randomness
– Noam Nisan
- 1994
|
|
268
|
Algebraic Methods for Interactive Proof Systems
– Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan
- 1990
|
|
267
|
Trading Group Theory for Randomness
– László Babai
- 1985
|
|
58
|
Derandomizing Arthur-Merlin Games using Hitting Sets
– Peter Bro Miltersen, N.V. Vinodchandran, Peter Bro, Miltersen N. V. Vinodchandran
- 1999
|
|
28
|
Pseudorandom Generators, Measure Theory, and Natural Proofs
– W. Regan, D. Sivakumar, Jin-yi Cai
- 1995
|
|
32
|
Resource-bounded measure
– J H Lutz
- 1998
|
|
212
|
Some connections between nonuniform and uniform complexity classes
– R Karp, R Lipton
- 1980
|
|
221
|
Checking Computations in Polylogarithmic Time
– László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
- 1991
|
|
453
|
Theory and applications of trapdoor functions
– A C Yao
- 1982
|
|
601
|
Pseudo-Random Generation from One-Way Functions
– Johan Håstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby
- 1988
|
