Tang, Shouwen; Book, Ronald V. Polynomial-time reducibilities and “almost all” oracle sets. (English) Zbl 0719.03020 Theor. Comput. Sci. 81, No. 1, 35-47 (1991). MSC: 03D15 68Q15 68Q05 PDFBibTeX XMLCite \textit{S. Tang} and \textit{R. V. Book}, Theor. Comput. Sci. 81, No. 1, 35--47 (1991; Zbl 0719.03020) Full Text: DOI
Book, Ronald V.; Ko, Ker-I On sets truth-table reducible to sparse sets. (English) Zbl 0665.68040 SIAM J. Comput. 17, No. 5, 903-919 (1988). Reviewer: G.Wechsung MSC: 68Q25 03D15 68Q05 03D30 PDFBibTeX XMLCite \textit{R. V. Book} and \textit{K.-I Ko}, SIAM J. Comput. 17, No. 5, 903--919 (1988; Zbl 0665.68040) Full Text: DOI
Book, Ronald V. (ed.) Studies in complexity theory. (English) Zbl 0666.68049 Research Notes in Theoretical Computr Science. London etc.: Pitman Publishing; VIII, 226 p.; £17.95 (1986). MSC: 68Q25 03D15 03H15 PDFBibTeX XML
Balćzar, José L.; Book, Ronald V.; Schöning, Uwe Sparse sets, lowness and highness. (English) Zbl 0621.68033 SIAM J. Comput. 15, 739-747 (1986). MSC: 68Q25 68Q05 03D15 PDFBibTeX XMLCite \textit{J. L. Balćzar} et al., SIAM J. Comput. 15, 739--747 (1986; Zbl 0621.68033) Full Text: DOI Link
Balcázar, Jose L.; Book, Ronald V.; Schöning, Uwe On bounded query machines. (English) Zbl 0608.68038 Theor. Comput. Sci. 40, 237-243 (1985). MSC: 68Q25 68Q05 PDFBibTeX XMLCite \textit{J. L. Balcázar} et al., Theor. Comput. Sci. 40, 237--243 (1985; Zbl 0608.68038) Full Text: DOI
Book, Ronald V.; Long, Timothy J.; Selman, Alan L. Quantitative relativizations of complexity classes. (English) Zbl 0599.03041 SIAM J. Comput. 13, 461-487 (1984). MSC: 03D15 03D10 68Q25 68Q05 PDFBibTeX XMLCite \textit{R. V. Book} et al., SIAM J. Comput. 13, 461--487 (1984; Zbl 0599.03041) Full Text: DOI
Balcázar, José L.; Book, Ronald V.; Schöning, Uwe Sparse oracles, lowness, and highness. (English) Zbl 0554.68033 Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 185-193 (1984). MSC: 68Q05 68Q25 03D55 PDFBibTeX XML