Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Polynomial hierarchy

Known as: Polynomial time hierarchy, Polynomial-time hierarchy 
In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes… Expand
Wikipedia

Related topics

Related topics

49 relations
AC0Analytical hierarchyArthur–Merlin protocolBelief revision
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
BQP and the polynomial hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence… Expand
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
On problems without polynomial kernels
Kernelization is a strong and widely-applied technique in parameterized complexity. A kernelization algorithm, or simply a kernel… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Approximate nearest neighbors: towards removing the curse of dimensionality
We present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces. For data sets of size n living… Expand
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
PP is as Hard as the Polynomial-Time Hierarchy
In this paper, two interesting complexity classes, PP and $ \oplus {\text{P}}$, are compared with PH, the polynomial-time… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The polynomial hierarchy and a simple model for competitive analysis
The multi-level linear programs of Candler, Norton and Townsley are a simple class of sequenced-move games, in which players are… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Separating the polynomial-time hierarchy by oracles
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
BPP and the Polynomial Hierarchy
Abstract BPP is the class of all sets that can be divided by a probabilistic Turing machine with bounded error probability within… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Parity, circuits, and the polynomial-time hierarchy
A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1976
Highly Cited
1976
The Polynomial-Time Hierarchy
Abstract The polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarchy in which deterministic… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Complete Sets and the Polynomial-Time Hierarchy
Abstract New proofs of two properties of the polynomial-time hierarchy are given. The classes in the hierarchy are characterized… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE