Skip to main content
SpringerLink
Log in

On sets bounded truth-table reducible to P-selective sets

  • Conference paper
  • First Online:
STACS 94 (STACS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 775))

Included in the following conference series:

Abstract

We show that if every NP set is ≤ Pbtt -reducible to some P-selective set, then NP is contained in DTIME(\(2^{n^{O\left( {{1 \mathord{\left/{\vphantom {1 {\sqrt {\log n} }}} \right.\kern-\nulldelimiterspace} {\sqrt {\log n} }}} \right)} }\)). The result is extended for some unbounded reducibilities such as ≤ Ppolylog-tt -reducibility.

Part of the work was done while the authors were visiting the University of Rochester, Department of Computer Science. This research is supported in part by JSPS/NSF International Collaboration Grant JSPS-ENGR-207/NSF-INT-9116781, DFG Postdoctorial Stipend Th 472/1-1, and NSF grant CCR-8957604.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. Recent Developments in Complexity Theory. Cambridge University Press, 1993. (Also available as Technical Report TR-417, University of Rochester, Department of Computer Science, Rochester, NY, April 1992).

    Google Scholar 

  2. E. Allender. The complexity of sparse sets in P, In Proceedings 1st Structure in Complexity Theory Conference, 1–11, IEEE Computer Society, 1986.

    Google Scholar 

  3. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1988).

    Google Scholar 

  4. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1991).

    Google Scholar 

  5. R. Beigel. NP-hard sets are P-superterse unless R = NP. Technical Report 88-04, Department of Computer Science, The John Hopkins University, 1988.

    Google Scholar 

  6. T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, McGraw-Hill Book Company, 1990.

    Google Scholar 

  7. S. Evan, A. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61:114–133, 1984.

    Google Scholar 

  8. L. Hemachandra, A. Hoene, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang. Selectivity. In Proceedings of the 5th International Conference on Computing and Information, 1993.

    Google Scholar 

  9. L. Hemachandra, M. Ogiwara, and O. Watanabe. How hard are sparse sets? In Proc. 7th Structure in Complexity Theory Conference, IEEE 222–238, 1992.

    Google Scholar 

  10. B. Jenner and J. Torán. Computing functions with parallel queries to NP. In Proc. 8th Structure in Complexity Theory Conference, IEEE 280–291, 1993.

    Google Scholar 

  11. C. Jockusch. Semirecursive sets and positive reducibility. Transactions of the AMS, 131(2):420–436, 1968.

    Google Scholar 

  12. R. Karp, R. Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28:191–209, 1982.

    Google Scholar 

  13. K. Ko. On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences, 26:209–221, 1983.

    Google Scholar 

  14. R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103–124, 1975.

    Google Scholar 

  15. S. Mahaney. Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences 25:130–143, 1982.

    Google Scholar 

  16. M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471–483, 1991.

    Google Scholar 

  17. S. Saluja. Relativized limitations of the left set technique and closure classes of sparse sets. Manuscript.

    Google Scholar 

  18. U. Schöning. The power of counting. In Complexity Theory Retrospective (A. Selman Ed.), Springer-Verlag (1990), 204–223.

    Google Scholar 

  19. A. Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Mathematical Systems Theory, 13:55–65, 1979.

    Google Scholar 

  20. A. Selman. Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control, 52:36–51, 1982.

    Google Scholar 

  21. A. Selman. Reductions on NP and P-selective sets. Theoretical Computer Science, 19:287–304, 1982.

    Google Scholar 

  22. L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science 3:1–22, 1977.

    Google Scholar 

  23. S. Toda. On polynomial-time truth-table reducibilities of intractable sets to P-selective sets. Mathematical Systems Theory, 24:69–82, 1991.

    Google Scholar 

  24. J. Torán. Personal Communication.

    Google Scholar 

  25. L. Valiant. Relative complexity of checking and evaluating. Information Processing Letters, 5(1):20–23, 1976.

    Google Scholar 

  26. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science 47:85–93, 1986.

    Google Scholar 

  27. O. Watanabe. Unpublished note.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abteilung für Theoretische Informatik, Universtät Ulm, Deutschland

    Thomas Thierauf

  2. Department Computer Science, Univiversity Electro-Communications, USA

    Seinosuke Toda

  3. Deptartment Computer Science, Tokyo Institute of Technology, Japan

    Osamu Watanabe

Authors
  1. Thomas Thierauf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seinosuke Toda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Osamu Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thierauf, T., Toda, S., Watanabe, O. (1994). On sets bounded truth-table reducible to P-selective sets. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_160

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_160

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation