Construct · 1 fields · 1 citations

polynomial hierarchy: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

a sequence of complexity classes built by stacking alternating existential and universal quantifiers over polynomial-time predicates, generalizing NP and coNP.

In theory of computation, polynomial hierarchy refers to a sequence of complexity classes built by stacking alternating existential and universal quantifiers over polynomial-time predicates, generalizing NP and coNP. This meaning comes from Stockmeyer (1976) in Theoretical Computer Science.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how polynomial hierarchy sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs hierarchy4 fields · 4 citationsjingle · one word, four constructs Karp-Lipton theorem1 fields · 1 citationsanchor · a standalone construct

References

Stockmeyer, L. J. (1976). The polynomial-time hierarchy. Theoretical Computer Science, 3(1), 1-22. https://doi.org/10.1016/0304-3975(76)90061-x

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct