# Polynomial hierarchy

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- 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

- J. Comput. Syst. Sci.
- 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

- STOC
- 2009

The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidenceâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- SIAM J. Comput.
- 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

- SIAM J. Comput.
- 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

- SIAM J. Comput.
- 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

- Structure in Complexity Theory Conference
- 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

- 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

- Inf. Process. Lett.
- 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

- 22nd Annual Symposium on Foundations of Computerâ€¦
- 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)

Is this relevant?