Separating the polynomial-time hierarchy by oracles

The polynomial-time hierarchy

1976 • 1,332 citations

Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

1975 • 750 citations

The equivalence problem for regular expressions with squaring requires exponential space

1972 • 620 citations

∑11-Formulae on finite structures

1983 • 589 citations

Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1

1981 • 390 citations

Lower bounds by probabilistic arguments

1983 • 221 citations

Parity, circuits, and the polynomial-time hierarchy

1981 • 202 citations

Borel sets and circuit complexity

1983 • 201 citations

Quantitative Relativizations of Complexity Classes

1984 • 152 citations

Languages which capture complexity classes

1983 • 106 citations

A second step toward the polynomial hierarchy

1979 • 88 citations

On counting problems and the polynomial-time hierarchy

1980 • 71 citations

On monotone formulae with restricted depth

1984 • 50 citations

Exponential lower bounds for restricted monotone circuits

1983 • 45 citations

Threshold functions and bounded deptii monotone circuits

1984 • 28 citations

Threshold functions and bounded depth monotone circuits

1986 • 22 citations

Sparse Oracles And Uniform Complexity Classes

2005 • 15 citations

Relativized questions involving probabilistic algorithms

1978 • 9 citations