Jump to content

PH (complexity)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gdr (talk | contribs) at 15:12, 16 May 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy: