John Gill

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

T. P. Baker, John Gill, Robert M Solovay · SIAM Journal on Computing · 1975 · 733 citations

Programming Language Theory, Computational Complexity Theory, Engineering +12

Computational Complexity of Probabilistic Turing Machines

John Gill · SIAM Journal on Computing · 1977 · 694 citations

Partial Function, Engineering, Abstract Complexity +14

Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1

Charles H. Bennett, John Gill · SIAM Journal on Computing · 1981 · 379 citations

Theory Of Computing, Combinatorics On Word, Computational Complexity Theory +13

Exact and approximate membership testers

Larry Carter, Robert W. Floyd, John Gill et al. · 1978 · 137 citations · Full text

Engineering, Verification, On-line Testing +17

Counting classes: thresholds, parity, mods, and fewness

Richard Beigel, John Gill · Theoretical Computer Science · 1992 · 123 citations

Combinatorics On Word, Enumerative Combinatorics, Computer Science +2