1. Bounded queries to SAT and the Boolean hierarchy;Beigel;Theoretical Computer Science,1987
2. Bounded Arithmetic, Bibliopolis, Napoli; revision of 1985 Princeton;Buss;University Ph.D. thesis,1986
3. Axiomatizations and conservation results for fragments of bounded arithmetic;Buss,1990
4. On truth-table reducibility to SAT and the difference hierarchy over NP;Buss,1988
5. The Boolean hierarchy. I. Structural properties;Cai;SIAM J. Comput.,1988