Loading AI tools
Class in computational complexity theory From Wikipedia, the free encyclopedia
In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy:
PH was first defined by Larry Stockmeyer.[1] It is a special case of hierarchy of bounded alternating Turing machine. It is contained in P#P = PPP and PSPACE.
PH has a simple logical characterization: it is the set of languages expressible by second-order logic.
PH contains almost all well-known complexity classes inside PSPACE; in particular, it contains P, NP, and co-NP. It even contains probabilistic classes such as BPP[2] (this is the Sipser–Lautemann theorem) and RP. However, there is some evidence that BQP, the class of problems solvable in polynomial time by a quantum computer, is not contained in PH.[3][4]
P = NP if and only if P = PH.[5] This may simplify a potential proof of P ≠ NP, since it is only necessary to separate P from the more general class PH.
PH is a subset of P#P = PPP by Toda's theorem; the class of problems that are decidable by a polynomial time Turing machine with access to a #P or equivalently PP oracle), and also in PSPACE.
This section is empty. You can help by adding to it. (February 2023) |
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.