P/poly

From Wikipedia, the free encyclopedia

In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function. It is also equivalently defined as the class PSIZE of languages that have a polynomial-size circuits.[1][2] This means that the machine that recognizes a language may use a different advice function or use a different circuit depending on the length of the input, and that the advice function or circuit will vary only on the size of the input.

For example, the popular Miller-Rabin primality test can be formulated as a P/poly algorithm: the "advice" is a list of candidate a values to test. It is possible to precompute a list of at most n values such that every composite n-bit number will be certain to have a witness a in the list. For example, if we're testing a 32-bit number, it is enough to test a = 2, 7, and 61.[3] This follows from the fact that for each composite n, 3/4s of all possible a values are witnesses; a simple counting argument similar to the one in the proof that BPP in P/poly below shows that there exists a suitable list of a values for every input size, although finding it may be expensive.

Note that P/poly, unlike other polynomial-time classes such as P or BPP, is not generally considered a practical class for computing. Indeed, it contains every undecidable unary language, none of which can be solved in general by real computers. On the other hand, if the input length is bounded by a relatively small number and the advice strings are short, it can be used to model practical algorithms with a separate expensive preprocessing phase and a fast processing phase, as in the example above.

Importance of P/poly

P/poly is an important class for several reasons. For theoretical computer science, there are several important properties that depend on P/poly:

  • If NP ⊆ P/poly then PH (the polynomial hierarchy) collapses to \Sigma _{2}^{{{\rm {P}}}}. This result is the Karp–Lipton theorem; furthermore, NP ⊆ P/poly implies AM = MA [4]
  • If PSPACE ⊆ P/poly then PSPACE = \Sigma _{2}^{{{\rm {P}}}}\cap \Pi _{2}^{{{\rm {P}}}}, even PSPACE = MA.
Proof: Consider a language L from PSPACE. It is known that there exists an interactive proof system for L, where actions of the prover can be carried out by a PSPACE machine. By assumption, the prover can be replaced by a polynomial-size circuit. Therefore, L has a MA protocol: Merlin sends the circuit as proof, and Arthur can simulate the IP protocol himself without any additional help.
  • If P#P ⊆ P/poly then P#P = MA.[5] The proof is similar to above, based on an interactive protocol for permanent and #P-completeness of permanent.
  • If EXPTIME ⊆ P/poly then EXPTIME = \Sigma _{2}^{{{\rm {P}}}}\cap \Pi _{2}^{{{\rm {P}}}} (Meyer's theorem), even EXPTIME = MA.
  • If NEXPTIME ⊆ P/poly then NEXPTIME = EXPTIME, even NEXPTIME = MA. Conversely, NEXPTIME = MA implies NEXPTIME ⊆ P/poly[6]
  • If EXPNP ⊆ P/poly then EXPNP = \Sigma _{2}^{{{\rm {P}}}}\cap \Pi _{2}^{{{\rm {P}}}} (Buhrman, Homer) [7]
  • It is known that MAEXP, an exponential version of MA, is not contained in P/poly.
Proof: If MAEXP ⊆ P/poly then PSPACE = MA (see above). By padding, EXPSPACE = MAEXP, therefore EXPSPACE ⊆ P/poly but this can be proven false with diagonalization.

One of the most interesting reasons that P/poly is important is the property that if NP is not a subset of P/poly, then P ≠ NP. This observation was the center of many attempts to prove P ≠ NP.

P/poly is also used in the field of cryptography. Security is often defined 'against' P/poly adversaries. Besides including most practical models of computation like BPP, this also admits the possibility that adversaries can do heavy precomputation for inputs up to a certain length, as in the construction of rainbow tables.

Although not all languages in P/poly are sparse languages, there is a polynomial-time Turing reduction from any language in P/poly to a sparse language.[8]

Adleman's theorem

Adleman's theorem, proved by Leonard Adleman, states that BPP ⊆ P/poly, where BPP is the set of problems solvable with randomized algorithms with two-sided error in polynomial time.[9] Variants of the theorem show that BPL is contained in L/poly and AM is contained in NP/poly.

Proof

Let L be a language in BPP, and let M(x,r) be a polynomial-time algorithm that decides L with error ≤ 1/3 (where x is the input string and r is a set of random bits).

Construct a new machine M'(x,R), which runs M 18n times (where n is the input length and R is a sequence of 18n independently random rs). Thus, M' is also polynomial-time, and has an error probability ≤ 1/en by Chernoff's bound (see BPP). If we can fix R then we obtain an algorithm that is deterministic.

If Bad(x) is defined as {R: M'(x,R) is incorrect}, we have:

\forall x\,{\mbox{Prob}}_{R}[R\in {\mbox{Bad}}(x)]\leq {\frac {1}{e^{n}}}.

The input size is n, so there are 2n possible inputs. Thus, the probability that a random R is bad for at least one input x is

{\mbox{Prob}}_{R}[\exists x\,R\in {\mbox{Bad}}(x)]\leq {\frac {2^{n}}{e^{n}}}<1.

In words, the probability that R is bad for some x is less than 1, therefore there must be an R that is good for all x. Take such an R to be the advice string in our P/poly algorithm.

See also

  • L/poly, a logarithmic space analogue of P/poly that captures the complexity of polynomial size branching programs

References

  1. ↑ Lutz, Jack H.; Schmidt, William J. (1993), "Circuit size relative to pseudorandom oracles", Theor. Comput. Sci. (Essex, UK: Elsevier Science Publishers Ltd.) 107 (1): 95–120, ISSN 0304-3975 
  2. ↑ Lecture notes on computational complexity by Peter Bro Miltersen
  3. ↑ Finding primes & proving primality
  4. ↑ If NP has Polynomial-Size Circuits, then MA = AM
  5. ↑ Non-deterministic Exponential Time has Two-Prover Interactive Protocols
  6. ↑ In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
  7. ↑ A Note on the Karp-Lipton Collapse for the Exponential Hierarchy
  8. ↑ Jin-Yi Cai. Lecture 11: P/poly, Sparse Sets, and Mahaney's Theorem. CS 810: Introduction to Complexity Theory. The University of Wisconsin–Madison. September 18, 2003.
  9. ↑ Adleman, L. M. (1978), "Two theorems on random polynomial time", Proceedings of the Nineteenth Annual IEEE Symposium on Foundations of Computer Science, pp. 75–83, doi:10.1109/SFCS.1978.37 
Important complexity classes (more)
Considered feasible
  • DLOGTIME
  • AC0
  • ACC0
  • TC0
  • L
  • SL
  • RL
  • NL
  • NC
  • SC
  • CC
  • P
    • P-complete
  • ZPP
  • RP
  • BPP
  • BQP
Suspected infeasible
  • UP
  • NP
    • NP-complete
    • NP-hard
    • co-NP
    • co-NP-complete
  • AM
  • PH
  • ⊕P
  • PP
  • #P
    • #P-complete
  • IP
  • PSPACE
    • PSPACE-complete
Considered infeasible
  • EXPTIME
  • NEXPTIME
  • EXPSPACE
  • ELEMENTARY
  • PR
  • R
  • RE
  • ALL
Class hierarchies
  • Polynomial hierarchy
  • Exponential hierarchy
  • Grzegorczyk hierarchy
  • Arithmetical hierarchy
  • Boolean hierarchy
Families of classes
  • DTIME
  • NTIME
  • DSPACE
  • NSPACE
  • Probabilistically checkable proof
  • Interactive proof system
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.