-
2
-
-
33747202996
-
-
in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
-
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992.
-
Proof Verification and Intractability of Approximation Problems
-
-
Arora, S.1
Lund, C.2
Motwani, R.3
Sudan, M.4
Szegedy, M.5
-
4
-
-
0002771903
-
-
Comput. Complexity, vol. 1, pp. 3-40, 1991
-
L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, vol. 1, pp. 3-40, 1991
-
Non-deterministic Exponential Time Has Two-prover Interactive Protocols
-
-
Babai, L.1
Fortnow, L.2
Lund, C.3
-
5
-
-
85028539051
-
-
in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
-
L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
-
Checking Computations in Polylogarithmic Time
-
-
Babai, L.1
Fortnow, L.2
Levin, L.3
Szegedy, M.4
-
6
-
-
0027308413
-
-
in Proc. 25th ACM Annu. Symp. on Theory of Computing, 1993.
-
M. Bellare, S. Goldwasser, G. Lund, and A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in Proc. 25th ACM Annu. Symp. on Theory of Computing, 1993.
-
Efficient Probabilistically Checkable Proofs and Applications to Approximation
-
-
Bellare, M.1
Goldwasser, S.2
Lund, G.3
Russell, A.4
-
9
-
-
0000619172
-
-
J. Comput. Syst. Sei., vol. 47, pp. 549-595, 1993.
-
M. Blum; M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J. Comput. Syst. Sei., vol. 47, pp. 549-595, 1993.
-
Self-testing/correcting with Applications to Numerical Problems
-
-
Blum, M.1
Luby, M.2
Rubinfeld, R.3
-
11
-
-
0026385082
-
-
in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991.
-
U. Feige, S. Goldwasser, L. Lovâsz, S. Safra, and M. Szegedy, "Approximating clique is almost NP-complete, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991.
-
Approximating Clique Is Almost NP-complete
-
-
Feige, U.1
Goldwasser, S.2
Lovâsz, L.3
Safra, S.4
Szegedy, M.5
-
14
-
-
33747155860
-
-
Self-testing/correcting for polynomials and for approximate functions, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
-
P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, Self-testing/correcting for polynomials and for approximate functions, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
-
-
-
Gemmell, P.1
Lipton, R.2
Rubinfeld, R.3
Sudan, M.4
Wigderson, A.5
-
16
-
-
0003649018
-
-
Ph.D. dissertation, MIT, Cambridge, MA, Feb. 1996
-
M. Kiwi, Probabilistically checkable proofs and the testing of Hadamard-like codes, Ph.D. dissertation, MIT, Cambridge, MA, Feb. 1996
-
Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes
-
-
Kiwi, M.1
-
17
-
-
33747157161
-
-
private communication, Oct. 1995.
-
D. J. Kleitman, private communication, Oct. 1995.
-
-
-
Kleitman, D.J.1
|