A. V. Aho, J. E. Hopcroft
, andJ. D. Ullman
,The Design and Analysis of Computer Algorithms
, Addison-Wesley, Reading MA, 1974.Google Scholar
, On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing.Probability in the Engineering and Informational Sciences
(1987), 33–46.Google Scholar
L. Babai, Trading group theory for randomness, inProc. 17th Ann. ACM Symp. Theory of Computing, 1985, 421–429.
L. Babai, E-mail and the unexpected power of interaction, in: Proc. 5th Ann. IEEE Structures in Complexity Theory Conf., 1990, 30–44.
, Representation of group elements as short products,Annals of Discrete Mathematics
(1982), 27–30.Google Scholar
, Arithmetization: a new method in structural complexity theory,Computational Complexity
(1991), 41–66. (Preliminary version appeared as: A characterization of #P
by arithmetic straight line programs, inProc. 31st Ann. IEEE Symp. Foundations of Comp. Sci.
, 1990, 26–34.)Google Scholar
L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in:Proc 23rd ACM Symp. Theory of Computing, 1991, to appear.
L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two-prover interactive protocols (extended abstract),Proc. 31st Ann. IEEE Symp. Found. Comp. Sci., 1990, 16–25.
L. Babai and P. Frankl,Linear Algebra Methods in Combinatorics, I, Preliminary Version, University of Chicago, Dept. C. S. 1988.
D. Beaver and J. Feigenbaum, Hiding instances in multioracle queries, inProc. 7th Symp. on Theoretical Aspects of Comp. Sci. Lecture Notes in Comp. Sci.
415 (1990), 37–48.
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, Multiprover interactive proofs: How to remove the intractability assumptions, inProc. 20th Ann. ACM Symp. Theory of Computing, 1988, 113–131.
M. Blum and S. Kannan, Designing programs that check their work, inProc. 21st Ann. ACM Symp. Theory of Computing, 1989, 86–97.
M. Blum, M. Luby, and R. Rubinfeld, Self-testing and self-correcting programs, with applications to numerical programs, inProc. 22nd Ann. ACM Symp. Theory of Computing, 1990, 73–83.
, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes.J. Comp. Sys. Sci.
(1988), 254–276.Google Scholar
J. Cai, PSPACE is provable by two provers in one round, manuscript, 1990.
S. A. Cook, The complexity of theorem proving procedures, inProc. 3rd Ann. ACM Symp. Theory of Computing 1971, 151–158.
U. Feige, S. Goldwasser, L. Lovász, and S. Safra, On the complexity of clique approximation, in preparation.
P. Feldman, The Optimum Prover lives inPSPACE, manuscript, 1986.
L. Fortnow, The Complexity of Perfect Zero-Knowledge, In S. Micali, ed.,Randomness and Computation, Advances in Computing Research
5 (1989), 327–343.
L. Fortnow, Complexity-Theoretic Aspects of Interactive Proof Systems, Ph.D. Thesis,Massachusetts Institute of Technology, Laboratory for Computer Science, Tech. Report MIT/LCS/TR-447 1989.
L. Fortnow, J. Rompel, and M. Sipser, On the power of multiprover interactive protocols,Proc. 3rd Structure in Complexity Theory Conf., 1988, 156–161.
, Are there interactive protocols for co-NP languages?,Inf. Process. Letters
(1988), 249–251.Google Scholar
S. Goldwasser, S. Micali
, andC. Rackoff
, The knowledge complexity of interactive proofs,SIAM J. Comput.
(1989), 186–208. (Preliminary version appeared inProc. 18th Ann. ACM Symp. Theory of Computing
, 1985, 291–304.)Google Scholar
J. Hartmanis, N. Immerman
, andV. Sewelson
, Sparse sets inNP-P: EXPTIME
versusNEXPTIME, Inf. and Control
(1985), 158–181.Google Scholar
On Relativized Exponential and Probabilistic Complexity Classes,Information and Computation
(1986), 231–243.Google Scholar
R. Karp, R. Lipton, Some Connections between Nonuniform and Uniform Complexity Classes,Proc. 12th Ann. ACM Symp. Theory of Computing, 1980, 302–309.
, Universal'nyîe perebornyîe zadachi (Universal search problems, in Russian),Problemy Peredachi Informatsii
(1973), 265–266. A corrected English translation appears in an appendix to Trakhtenbrot .Google Scholar
R. Lipton, New directions in testing, inProceedings of the DIMACS Workshop on Distributed Computing and Cryptography, 1989, to appear.
C. Lund, L. Fortnow, H. Karloff, and N. Nisan, Algebraic methods for interactive proof systems, inProc. 31st Ann. IEEE Symp. Foundations of Comp. Sci., 1990, 1–10.
, Complexity Classes of Alternating Machines with Oracles,Proc. 10th ICALP, Lecture Notes in Comp. Sci.
(1983), 573–584.Google Scholar
C. Papadimitriou, Games against Nature,Proc. 24th Ann. IEEE Symp. Foundations of Comp. Sci., 1983, 446–450.
G. Peterson and J. Reif, Multiple-person alternation,Proc. 20th Ann. IEEE Symp. Foundations of Comp. Sci., 1979, 348–363.
, Relativized Arthur-Merlin versus Merlin-Arthur games,Inf. and Computation
(1989), 44–49.Google Scholar
J. Seiferas, M. Fischer
, andA. Meyer
, Separating Nondeterministic Time Complexity ClassesJ. Assoc. Comput. Mach.
(1978), 146–167.Google Scholar
A. Shamir, IP=PSPACE, inProc. 31st Ann. IEEE Symp. Foundations of Comp. Sci., 1990, 11–15.
J. Simon, On Some Central Problems in Computational Complexity, Ph.D. Thesis,Cornell University, Computer Science, Tech. Report TR 74-224, 1975.
J. T. Schwartz
, Fast probabilistic algorithms for verification of polynomial identities,J. Assoc. Comput. Mach.
(1980), 701–717.Google Scholar
M. Szegedy, EfficientMIP protocol and a stronger condition on clique approximation, in preparation.
B. A. Trakhtenbrot
, A survey of Russian approaches toPerebor
(brute-force search) algorithms,Annals of the History of Computing
(1984), 384–400.Google Scholar
S. Toda, On the computational power ofPP and ⊕P, inProc. 30th Ann. IEEE Symp. Foundations of Comp. Sci., 1989, 514–519.
, The complexity of computing the permanent,Theoretical Computer Science
(1979), 189–201.Google Scholar
L. Valiant, V. Vazirani
is as Easy as Detecting Unique Solutions,Theoretical Computer Science
(1986), 85–93.Google Scholar