|
221
|
Checking Computations in Polylogarithmic Time
– László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
- 1991
|
|
893
|
The knowledge complexity of interactive proof systems
– Shafi Goldwasser, Silvio Micali, Charles Rackoff
- 1989
|
|
12
|
Free bits and non-approximability
– M Bellare, O Goldreich, M Sudan
- 1995
|
|
3
|
Linearity testing in chacaracteristic two
– M Bellare, D Coppersmith, J Hastad, M Kiwi, M Sudan
- 1995
|
|
3
|
The noisy oracle model
– U Feige, A Shamir, M Tennenholtz
- 1987
|
|
2
|
some of this material is
– L Babai, S Moran
- 1988
|
|
2
|
Random debaters and the hardness of approximting stochastic functions
– A Condon, J Feigenbaum, C Lund, P Shor
- 1994
|
|
2
|
Approximating clique is almost NP-complete
– Manuscript F Ergun, S Ravikumar, D Sivakumar Manuscript
- 1995
|
|
2
|
Combinatorial problems of elementary group theory
– C Lund
- 1994
|
|
2
|
Sip96] M. Sipser. Introduction to the theory of computation
– Manuscript
- 1991
|
|
16
|
Transparent Proofs and Limits to Approximation
– László Babai
- 1994
|
|
20
|
Low-degree tests
– K Friedl, Z Hatsagi, A Shen
- 1994
|
|
19
|
Robust Characterizations of Polynomials and their Applications to Program Testing
– R Rubinfeld, M Sudan
- 1993
|
|
3
|
Universal’nyĭe perebornyĭe zadachi
– L Levin
- 1973
|
|
33
|
Testing of the long code and hardness for clique
– J H˚astad
- 1996
|
|
27
|
Computational Models of Games
– A Condon
- 1989
|
|
20
|
Universal games of incomplete information
– J H Reif
- 1979
|
|
29
|
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions
– Anne Condon, Joan Feigenbaum, Carsten Lund, Peter Shor
- 1993
|
|
33
|
Multiple-person alternation
– Peterson andJohn H Reif
- 1979
|
