|
In computational complexity
theory, the complexity class PH is the union
of all complexity classes in the polynomial hierarchy:
-
PH is contained in the complexity classes PPP (the class of problems that are
decidable by a polynomial time Turing machine with an access to
PP oracle) and PSPACE.
This article is a stub. You can
help Wikipedia by expanding it .
|