Richard__Beigel
Approximable sets
Bi-immunity results for cheatable sets
Bounded queries to SAT and the Boolean hierarchy
Bounded query classes and the difference hierarchy
Circuits over PP and PL
Nondeterministic bounded query reducibilities
On being incoherent without being very hard
On the complexity of finding the chromatic number of a recursive graph I: The bounded case
PP is closed under intersection
Relativized counting classes: Relations among thresholds, parity, and mods
The polynomial method in circuit complexity
Unbounded searching algorithms