On the power of deterministic reductions to C=P

Bounded Query Classes

Klaus W. Wagner · SIAM Journal on Computing · 1990 · 293 citations

Circuit Complexity, Np Oracle, Computational Complexity Theory +16

The complexity of combinatorial problems with succinct input representation

Klaus W. Wagner · Acta Informatica · 1986 · 292 citations

Computational Complexity Theory, Engineering, Automated Reasoning +6

On the computational power of PP and (+)P

Seinosuke Toda · 1989 · 233 citations

Mathematical Programming, Computational Complexity Theory, Polynomial-time Reducibility +8

BPP and the polynomial hierarchy

Clemens Lautemann · Information Processing Letters · 1983 · 213 citations

Mathematical Programming, Computational Complexity Theory, Engineering +5

The Boolean Hierarchy I: Structural Properties

Jin‐Yi Cai, Thomas Gundermann, Juris Hartmanis et al. · SIAM Journal on Computing · 1988 · 200 citations

Circuit Complexity, Engineering, Boolean Function +14