Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2010

Highly Cited

2010

The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

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

We present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces. For data sets of size n living… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

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 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

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

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

A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the… Expand

Is this relevant?

Highly Cited

1976

Highly Cited

1976

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

Abstract New proofs of two properties of the polynomial-time hierarchy are given. The classes in the hierarchy are characterized… Expand

Is this relevant?