Efficiently Approximable Real-Valued Functions

We define a class, denoted APP, of real-valued functions f : {0, 1}n → [0, 1] such that f can be approximated to within any > 0 by a probabilistic Turing machine running in time poly(n, 1/ ). The class APP can be viewed as a generalization of BPP. We argue that APP is more natural and more important than BPP, and that most results about BPP are better stated as results about APP. We show that APP contains a natural complete problem: computing the acceptance probability of a given Boolean circuit. In contrast, no complete problem is known for BPP. We observe that all known complexity-theoretic assumptions under which BPP can be derandomized also allow APP to be derandomized. On the other hand we construct an oracle under which BPP = P but APP does not collapse to the corresponding deterministic class AP. (However any oracle collapsing APP to AP also collapses BPP to P.)

[1]  J. Shepherdson.  Computational Complexity of Real Functions , 1985 .

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

[3]  Lance Fortnow,et al.  One-sided Versus Two-sided Error in Probabilistic Computation , 1999, STACS.

[4]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

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

[6]  Michael Sipser,et al.  On Relativization and the Existence of Complete Sets , 1982, ICALP.

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

[8]  Juris Hartmanis,et al.  One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets , 1987, Proceeding Structure in Complexity Theory.

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

[10]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[11]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1986, Theor. Comput. Sci..

[12]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[13]  Avi Wigderson,et al.  Near-optimal conversion of hardness into pseudo-randomness , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  José D. P. Rolim,et al.  Weak random sources, hitting sets, and BPP simulations , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[15]  Avi Wigderson,et al.  Improved Derandomization of BPP Using a Hitting Set Generator , 1999, RANDOM-APPROX.

[16]  Juris Hartmanis,et al.  Containment, Separation, Complete Sets, and Immunity of Complexity Classes , 1986, ICALP.

[17]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[18]  José D. P. Rolim,et al.  A new general derandomization method , 1998, JACM.

[19]  Nikolai K. Vereshchagin,et al.  A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes , 1996, Theor. Comput. Sci..

[20]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[21]  Moni Naor,et al.  Decision trees and downward closures , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.