Separating polynomial-time turing and truth-table reductions by tally sets

1. Allender, E., and Rubinstein, R., P-printable sets, SIAM J. Comput., to appear.

   Google Scholar 

2. Allender, E., and Watanabe, O., Kolmogorov complexity and degrees of tally sets, Proc. 3rd IEEE Conf. Structure in Complexity Theory (1988), to appear.

   Google Scholar 

3. Balcázar, J., and Book, R., Sets with small generalized Kolmogorov complexity, Acta Informatica 23 (1986), 679–688.

   Google Scholar 

4. Berman, L., and Hartmanis, J., On isomorphisms and density of NP and other complete sets, SIAM J. Comput. 6 (1977), 305–322.

   Google Scholar 

5. Book, R., Bounded query machines: on NP and PSPACE, Theoret. Comput. Sci. 15 (1981), 27–39.

   Google Scholar 

6. Book, R., and Ko, K., On sets truth-table reducible to sparse sets, SIAM J. Comput. 17 (1988), to appear. Also see Proc. 2nd Conf. Structure in Complexity Theory (1987), 147–155.

   Google Scholar 

7. Book, R., and Wrathall, C., Bounded query machines: on NP() and NPQUERY(), Theoret. Comput. Sci. 15 (1981), 41–50.

   Google Scholar 

8. Ko, K., Continuous optimization problems and a polynomial hierarchy of real functions, J. Complexity 1 (1985), 210–231.

   Google Scholar 

9. Ko, K., Distinguishing conjunctive and disjunctive reducibilities by sparse sets, submitted for publication.

   Google Scholar 

10. Ladner, R., Lynch, N., and Selman, A., A comparison of polynomial-time reducibilities, Theoret. Comput. Sci. 1 (1975), 103–123.

    Google Scholar 

11. Long, T., Strong nondeterministic polynomial-time reducibilities, Theoret. Comput. Sci. 21 (1982), 1–25.

    Google Scholar 

12. Long, T., On restricting the size of oracles compared with restricting access to oracles, SIAM J. Comput. 14 (1985), 585–597.

    Google Scholar 

13. Mahaney, S., Sparse complete sets for NP: solution to a conjecture by Berman and Hartmanis, J. Comput. Syst. Sci. 25 (1982), 130–143.

    Google Scholar 

14. Hartmanis, J. (ed.), Computational Complexity Theory, Proc. Symp. Applied Mathematics, American Mathematical Society, 1988, to appear.

    Google Scholar 

15. Schöning, U., Complexity and Structure, Lecture Notes in Computer Science 211 (1986), Springer-Verlag Publishing Co.

    Google Scholar 

Download references