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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
  • M ICHAEL J. B REMNER, R ICHARD J OZSA
  • 2011
We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Kernelization is a strong and widely-applied technique in parameterized complexity. In a nutshell, a kernelization algorithm, or… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence… (More)
  • figure 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In this paper, it is shown that many natural counting classes, such as PP, C=P, and MODkP, arc at least as computationally hard… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper, two interesting complexity classes, PP and P, are compared with PH, the polynomial-time hierarchy. It is shown… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that co-NP C_ NPs, and therefore… (More)
Is this relevant?
Review
1986
Review
1986
Intuitionistic theories IS: of Bounded Arithmetic a re introduced and i t is shown tha t the definable functions of IS: a re… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
A function f is realizable in bounded depth and g(n) size .if there is a sequence of circuits 0 1 , C2 ,.·•• mane np of !\,V, and… (More)
  • figure 1
  • figure 2
Is this relevant?