Checking computations in polylogarithmic time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 21-42

  Babai, Lázló ^a   Fortnow, Lance ^a   Levin, Leonid A ^b   Szegedy, Mario ^a  

^a UNIVERSITY OF CHICAGO   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); ERROR CORRECTION; MONTE CARLO METHODS; POLYNOMIAL APPROXIMATION; SOFTWARE RELIABILITY; SUPERCOMPUTERS;

COMPUTATIONAL TASK; ERROR CORRECTING CODE; GENERIC MECHANISM; INPUT AND OUTPUTS; INTERACTIVE PROOFS; MATHEMATICAL PROOF; POLYLOGARITHMIC TIME; SOFTWARE AND HARDWARES;

COMPUTATION THEORY;

EID: 85028539051     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103428     Document Type: Conference Paper

References (34)

1. Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. Part II: Reducibility, Illinois J. Math. 21 (1977), 491-567.
2. Aho, A., Hopcroft, J., Unman, J.: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
3. Babai, L.: Trading group theory for randomness, Proc. ltth ACM STOC (1985), pp. 421-429.
4. Babai, L., Fortnow, L.: Arithmetization: A new method in structural complexity theory, Computational Complexity 1 (1991), to appear. Preliminary version: A characterization of #P by straight line programs of polynomials, Proc. 31th IEEE FOGS (1990), pp. 26-34.
5. Babai, L., Fortnow, L., Lund, C.: Non-Deterministic exponential time has two-prover interactive protocols, Computational Complexity 1 (1991), to appear. Preliminary version in: Proc, 31th IEEE FOCS (1990), pp. 16-25.
6. Beaver, D., Feigenbaurn J.: Hiding Instances in Multioracle Queries, Proc. 7th Symp. on TheoreticalAspects of Comp. Sci. , LNCS415 (1990), pp. 37-48.
7. Ben-Or, M., Goidwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: How to remove the intractability assumptions, Proc. 20th ACM STOC(1988), pp. 113-131.
8. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. 2O STOC (1988), pp. 1-10.
9. Blum, M.: Designing programs to check their work, to appear
10. Blum, M., Kannan, S.: Designing Programs that Check Their Work, Proc. 21st ACM STOC(1989), pp. 86-97.
11. Blum, M., Luby, M., Rubinfeld, R.: Self-Testing and Self-correcting programs, with Applications to Numerical Programs, Proc. 22nd ACM STOC (1990), pp. 73-83.
12. Cai, J.: PSPACE is provable by two provers in one round, manuscript (1990).
13. Cook, S. A.: The complexity of theorem proving procedures, Proc. 3rd ACM Symp. on Theory of Computing (1971), pp. 151-158.
14. Fortnow, L., Rompel, J., Sipser, M.: On the power of multi-prover interactive protocols, Proc. 3rd Structure in Complexity Theory Gout (1988), pp. 156-161.
15. Gorenstein, D.: The Enormous Theorem, Scientific American 253:6 (December 1985), 104-115.
16. Goidwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 291-304.
17. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
18. Gurevich, Yuri: On Kolmogorov Machines and Related Issues. (The Logic in Computer Science Column). Bulletin of EATCS, 1988.
19. Karp, R. M.: Reducibility among Combinatorial Problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York 1972, pp. 85-103.
20. Kolmogorov, A.N., Uspenskii, V.A.: On the Definition of an Algorithm. Uspekhi Mat. Nauk, 13 (1958), 3-28
21. AMS Transi. 2nd ser. 29 (1963), 217-245.
22. Levin, L.A.: Universalnyie perebornyle zadachi. (Universal search problems: in Russian). Problemy Peredachi Informatsii 9(3):265-266. A corrected English translation appears in an appendix to Trakhtenb rot [Tr].
23. Levin, L.A., Gács, P.: Causal Nets or What Is a Deterministic Computation? Information and Control, 51 (1982).
24. Lipton, R. J.: New directions in testing, manuscript (1989).
25. Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic Methods for Interactive Proof Systems, Proc. 3lth IEEE Symp. on Foundations of Computer Science (1990), pp. 2-10.
26. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
27. Ofman, Yu.: A Universal Automaton, Transactions of the Moscow Mathematical Society (1965), 200-215.
28. Peterson, W. W., Weldon, E. J., Jr.: Error. correcting Codes, MIT Press, 1972.
29. Shamir, A.: IP=PSPACE, Proc. Sith IEEE FOGS (1990), pp. 11-15.
30. Schönhage, A.: Storage Modification Machines. SIAM J. on Computing, 9(3):490-508, 1980.
31. Schwartz, J. T.: Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980), 701-717.
32. Simon, J.: On Some Central Problems in Computational Complexity, Ph.D. Thesis, Cornell University, Computer Science, Tech Report TR 75-224, (1975).
33. Szegedy, M.: Efficient MIP protocol and a stronger condition on clique approximation, in preparation
34. Trakhtenbrot, B.A.: A survey of Russian approaches to Perebor (brute-force search) algorithms. Anual5 of th History of Computing, 6 (1984), 384-400.