1. Polynomial time truth-table reductions to p-selective sets;Agrawal,1994
2. Some connections between bounded query classes and nonuniform complexity;Amir,1990
3. Query-limited reducibilities;Beigel,1987
4. A structural theorem that depends quantitatively on the complexity of SAT;Beigel,1987
5. Terse, superterse, and verbose sets;Beigel;Inform. and Comput.,1993