The Role of Relativization in Complexity Theory

Several recent nonrelativizing results in the area of interactive proofs have caused many people to review the importance of relativization. In this paper we take a look at how complexity theorists use and misuse oracle results. We pay special attention to the new interactive proof systems and program checking results and try to understand why they do not relativize. We give some new results that may help us to understand these questions better.

[1]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[2]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[3]  Christopher B. Wilson.  Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  Daniel A. Spielman,et al.  PP is closed under intersection , 1991, STOC '91.

[5]  Juris Hartmanis.  Feasible computations and provable complexity properties , 1989, CBMS-NSF regional conference series in applied mathematics.

[6]  Jonathan F. Buss,et al.  Relativized Alternation and Space-Bounded Computation , 1988, J. Comput. Syst. Sci..

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Juris Hartmanis,et al.  Some Observations about Relativization of Space Bounded Computations , 1988, Current Trends in Theoretical Computer Science.

[9]  Stuart A. Kurtz,et al.  On the random oracle hypothesis , 1982, STOC '82.

[10]  Judy Goldsmith,et al.  Three results on the polynomial isomorphism of complete sets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[11]  Desh Ranjan,et al.  Structural Complexity Theory: recent Surprises , 1990, SWAT.

[12]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[13]  Stuart A. Kurtz,et al.  On oracle builder's toolkit , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[14]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[15]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[16]  Richard Chang,et al.  An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof , 1989, Bull. EATCS.

[17]  Lance Fortnow,et al.  On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..

[18]  Boris A. Trakhtenbrot,et al.  A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[21]  Stuart A. Kurtz,et al.  The Isomorphism Conjecture Holds Relative to an Oracle , 1996, SIAM J. Comput..

[22]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[23]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[24]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[25]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[26]  Lance Fortnow,et al.  Are There Interactive Protocols for CO-NP Languages? , 1988, Inf. Process. Lett..

[27]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[28]  Steven Homer,et al.  Oracles for structural properties: the isomorphism problem and public-key cryptography , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[29]  Shlomo Moran,et al.  Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies , 1981, J. Comput. Syst. Sci..

[30]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[31]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[32]  László Babai,et al.  E-mail and the unexpected power of interaction , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[33]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[34]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[35]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[36]  Lance Fortnow,et al.  Separability and One-Way Functions , 1994, ISAAC.

[37]  Oded Goldreich,et al.  The Random Oracle Hypothesis Is False , 1994, J. Comput. Syst. Sci..