Bounded Error Probability In Polynomial Time

In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability bounded by 1/3 for all instances.
BPP is one of the largest ''practical'' classes of problems, meaning most problems of interest in BPP have efficient probabilistic algorithms that can be run quickly on real modern machines. BPP also contains P, the class of problems solvable in polynomial time with a deterministic machine, since a deterministic machine is a special case of a probabilistic machine.

Informally, a problem is in BPP if there is an algorithm for it that has the following properties:
*It is allowed to flip coins and make random decisions
*It is guaranteed to run in polynomial time
*On any given run of the algorithm, it has a probability of at most 1/3 of giving the wrong answer, whether the answer is YES or NO.

Definition

A language ''L'' is in BPP if and only if there exists a probabilistic Turing machine ''M'', such that
* ''M'' runs for polynomial time on all inputs
* For all ''x'' in ''L'', ''M'' outputs 1 with probability greater than or equal to 2/3
* For all ''x'' not in ''L'', ''M'' outputs 1 with probability less than or equal to 1/3
Unlike the complexity class ZPP, the machine ''M'' is required to run for polynomial time on all inputs, regardless of the outcome of the random coin flips.

Alternatively, BPP can be defined using only deterministic Turing machines. A language ''L'' is in BPP if and only if there exists a polynomial ''p'' and deterministic Turing machine ''M'', such that
* ''M'' runs for polynomial time on all inputs
* For all ''x'' in ''L'', the fraction of strings ''y'' of length ''p''(, ''x'', ) which satisfy is greater than or equal to 2/3
* For all ''x'' not in ''L'', the fraction of strings ''y'' of length ''p''(, ''x'', ) which satisfy is less than or equal to 1/3
In this definition, the string ''y'' corresponds to the output of the random coin flips that the probabilistic Turing machine would have made. For some applications this definition is preferable since it does not mention probabilistic Turing machines.

In practice, an error probability of 1/3 might not be acceptable, however, the choice of 1/3 in the definition is arbitrary. Modifying the definition to use any constant between 0 and 1/2 (exclusive) in place of 1/3 would not change the resulting set BPP. For example, if one defined the class with the restriction that the algorithm can be wrong with probability at most 1/2¹⁰⁰, this would result in the same class of problems. The error probability does not even have to be constant: the same class of problems is defined by allowing error as high as 1/2 − ''n''^−''c'' on the one hand, or requiring error as small as 2^−''nc'' on the other hand, where ''c'' is any positive constant, and ''n'' is the length of input. This flexibility in the choice of error probability is based on the idea of running an error-prone algorithm many times, and using the majority result of the runs to obtain a more accurate algorithm. The chance that the majority of the runs are wrong drops off exponentially as a consequence of the Chernoff bound.

Problems

All problems in P are obviously also in BPP. However, many problems have been known to be in BPP but not known to be in P. The number of such problems is decreasing, and it is conjectured that P = BPP.

For a long time, one of the most famous problems known to be in BPP but not known to be in P was the problem of determining whether a given number is prime. However, in the 2002 paper '' PRIMES is in P'', Manindra Agrawal and his students Neeraj Kayal and Nitin Saxena found a deterministic polynomial-time algorithm for this problem, thus showing that it is in P.

An important example of a problem in BPP (in fact in co-RP) still not known to be in P is polynomial identity testing, the problem of determining whether a polynomial is identically equal to the zero polynomial, when you have access to the value of the polynomial for any given input, but not to the coefficients. In other words, is there an assignment of values to the variables such that when a nonzero polynomial is evaluated on these values, the result is nonzero? It suffices to choose each variable's value uniformly at random from a finite subset of at least ''d'' values to achieve bounded error probability, where ''d'' is the total degree of the polynomial.

Related classes

If the access to randomness is removed from the definition of BPP, we get the complexity class P. In the definition of the class, if we replace the ordinary Turing machine with a quantum computer, we get the class BQP.

Adding postselection to BPP, or allowing computation paths to have different lengths, gives the class BPP_path. BPP_path is known to contain NP, and it is contained in its quantum counterpart PostBQP.

A Monte Carlo algorithm is a randomized algorithm which is likely to be correct. Problems in the class BPP have Monte Carlo algorithms with polynomial bounded running time. This is compared to a Las Vegas algorithm which is a randomized algorithm which either outputs the correct answer, or outputs "fail" with low probability. Las Vegas algorithms with polynomial bound running times are used to define the class ZPP. Alternatively, ZPP contains probabilistic algorithms that are always correct and have expected polynomial running time. This is weaker than saying it is a polynomial time algorithm, since it may run for super-polynomial time, but with very low probability.

Complexity-theoretic properties

It is known that BPP is closed under complement; that is, BPP = co-BPP. BPP is low for itself, meaning that a BPP machine with the power to solve BPP problems instantly (a BPP oracle machine) is not any more powerful than the machine without this extra power. In symbols, BPP^BPP = BPP.

The relationship between BPP and NP is unknown: it is not known whether BPP is a subset of NP, NP is a subset of BPP or neither. If NP is contained in BPP, which is considered unlikely since it would imply practical solutions for NP-complete problems, then NP = RP and PH ⊆ BPP.

It is known that RP is a subset of BPP, and BPP is a subset of PP. It is not known whether those two are strict subsets, since we don't even know if P is a strict subset of PSPACE. BPP is contained in the second level of the polynomial hierarchy and therefore it is contained in PH. More precisely, the Sipser–Lautemann theorem states that $\mathsf \subseteq \Sigma_2 \cap \Pi_2$. As a result, P = NP leads to P = BPP since PH collapses to P in this case. Thus either P = BPP or P ≠ NP or both.

Adleman's theorem states that membership in any language in BPP can be determined by a family of polynomial-size Boolean circuits, which means BPP is contained in P/poly. Indeed, as a consequence of the proof of this fact, every BPP algorithm operating on inputs of bounded length can be derandomized into a deterministic algorithm using a fixed string of random bits. Finding this string may be expensive, however. Some weak separation results for Monte Carlo time classes were proven by , see also .

Closure properties

The class BPP is closed under complementation, union and intersection.

Relativization

Relative to oracles, we know that there exist oracles A and B, such that P^A = BPP^A and P^B ≠ BPP^B. Moreover, relative to a random oracle with probability 1, P = BPP and BPP is strictly contained in NP and co-NP.

There is even an oracle in which BPP=EXP^NP (and hence P<NP<BPP=EXP=NEXP), which can be iteratively constructed as follows. For a fixed E^NP (relativized) complete problem, the oracle will give correct answers with high probability if queried with the problem instance followed by a random string of length ''kn'' (''n'' is instance length; ''k'' is an appropriate small constant). Start with ''n''=1. For every instance of the problem of length ''n'' fix oracle answers (see lemma below) to fix the instance output. Next, provide the instance outputs for queries consisting of the instance followed by ''kn''-length string, and then treat output for queries of length ≤(''k''+1)''n'' as fixed, and proceed with instances of length ''n''+1.

Lemma: Given a problem (specifically, an oracle machine code and time constraint) in relativized E^NP, for every partially constructed oracle and input of length ''n'', the output can be fixed by specifying 2^''O''(''n'') oracle answers.

Proof: The machine is simulated, and the oracle answers (that are not already fixed) are fixed step-by-step. There is at most one oracle query per deterministic computation step. For the relativized NP oracle, if possible fix the output to be yes by choosing a computation path and fixing the answers of the base oracle; otherwise no fixing is necessary, and either way there is at most 1 answer of the base oracle per step. Since there are 2^''O''(''n'') steps, the lemma follows.

The lemma ensures that (for a large enough ''k''), it is possible to do the construction while leaving enough strings for the relativized E^NP answers. Also, we can ensure that for the relativized E^NP, linear time suffices, even for function problems (if given a function oracle and linear output size) and with exponentially small (with linear exponent) error probability. Also, this construction is effective in that given an arbitrary oracle A we can arrange the oracle B to have P^A≤P^B and EXP^NPA=EXP^NPB=BPP^B. Also, for a ZPP=EXP oracle (and hence ZPP=BPP=EXP<NEXP), one would fix the answers in the relativized E computation to a special nonanswer, thus ensuring that no fake answers are given.

Derandomization

The existence of certain strong pseudorandom number generators is conjectured by most experts of the field. This conjecture implies that randomness does not give additional computational power to polynomial time computation, that is, P = RP = BPP. Note that ordinary generators are not sufficient to show this result; any probabilistic algorithm implemented using a typical random number generator will always produce incorrect results on certain inputs irrespective of the seed (though these inputs might be rare).

László Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson showed that unless EXPTIME collapses to MA, BPP is contained in
:$\textsf = \bigcap\nolimits_ \textsf \left (2^ \right).$
The class i.o.-SUBEXP, which stands for infinitely often SUBEXP, contains problems which have sub-exponential time algorithms for infinitely many input sizes. They also showed that P = BPP if the exponential-time hierarchy, which is defined in terms of the polynomial hierarchy and E as E^PH, collapses to E; however, note that the exponential-time hierarchy is usually conjectured ''not'' to collapse.

Russell Impagliazzo and Avi Wigderson showed that if any problem in E, where
:$\mathsf = \mathsf \left( 2^ \right),$
has circuit complexity 2^Ω(''n'') then P = BPP.Russell Impagliazzo and Avi Wigderson (1997). "P = BPP if E requires exponential circuits: Derandomizing the XOR Lemma". ''Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing'', pp. 220–229.

See also

* RP
* ZPP
* BQP
* List of complexity classes

References

* Valentine Kabanets (2003). "CMPT 710 – Complexity Theory: Lecture 16". Simon Fraser University.
* Pages 257–259 of section 11.3: Random Sources. Pages 269–271 of section 11.4: Circuit complexity.
* Section 10.2.1: The class BPP, pp. 336–339.
*
*
* Arora, Sanjeev; Boaz Barak (2009). "Computational Complexity: A Modern Approach".

External links

Princeton CS 597E: Derandomization paper list

Harvard CS 225: Pseudorandomness

{{DEFAULTSORT:Bpp
Probabilistic complexity classes