1. Oracles versus proof techniques that do not relativize;Allender,1990
2. Some connections between bounded query classes and nonuniform complexity;Amir,1990
3. Non-deterministic exponential time has two-prover interactive protocols;Babai,1990
4. Bounded queries to SAT and the boolean hierarchy;Beigel;Theoret. Comput. Sci.,1991