Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2014: Mathematical Foundations of Computer Science 2014 pp 311–323Cite as

Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes

  • Conference paper

  • 1145 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8635))

Abstract

We study the autoreducibility and mitoticity of complete sets for NP and other complexity classes, where the main focus is on logspace reducibilities. In particular, we obtain:

  • For NP and all other classes of the PH: Each \(\leq^{\rm log}_{\rm m}\)-complete set is \(\leq^{\rm log}_{\rm T}\)-autoreducible.

  • For P, \(\Delta^p_k\), NEXP: Each \(\leq^{\rm log}_{\rm m}\)-complete set is a disjoint union of two \(\leq^{\rm log}_{\rm 2-tt}\)-complete sets.

  • For PSPACE: Each \(\leq^{\rm p}_{\rm dtt}\)-complete set is a disjoint union of two \(\leq^{\rm p}_{\rm dtt}\)-complete sets.

Proofs omitted in this version can be found in the technical report [14].

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambos-Spies, K.: P-mitotic sets. In: Börger, E., Rödding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol. 171, pp. 1–23. Springer, Heidelberg (1984)

    Google Scholar 

  2. Beigel, R., Feigenbaum, J.: On being incoherent without being very hard. Computational Complexity 2, 1–17 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Berman, L.: Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, Ithaca, NY (1977)

    Google Scholar 

  4. Buhrman, H.: Resource Bounded Reductions. PhD thesis, University of Amsterdam (1993)

    Google Scholar 

  5. Buhrman, H., Fortnow, L., van Melkebeek, D., Torenvliet, L.: Separating complexity classes using autoreducibility. SIAM J. Comput. 29(5), 1497–1520 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Buhrman, H., Hoene, A., Torenvliet, L.: Splittings, robustness, and structure of complete sets. SIAM J. Comput. 27(3), 637–653 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Buhrman, H., Torenvliet, L.: A Post’s program for complexity theory. Bulletin of the EATCS 85, 41–51 (2005)

    MATH  MathSciNet  Google Scholar 

  8. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control 70(1), 32–53 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ganesan, K., Homer, S.: Complete problems and strong polynomial reducibilities. SIAM J. Comput. 21(4), 733–742 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Glaßer, C.: Space-efficient informational redundancy. J. Comput. System Sci. 76(8), 792–811 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  11. Glaßer, C., Nguyen, D.T., Reitwießner, C., Selman, A.L., Witek, M.: Autoreducibility of complete sets for log-space and polynomial-time reductions. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 473–484. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Glaßer, C., Ogihara, M., Pavan, A., Selman, A.L., Zhang, L.: Autoreducibility, mitoticity, and immunity. J. Comput. System Sci. 73(5), 735–754 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Glaßer, C., Pavan, A., Selman, A.L., Zhang, L.: Splitting NP-complete sets. SIAM J. Comput. 37(5), 1517–1535 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Glaßer, C., Witek, M.: Autoreducibility and mitoticity of logspace-complete sets for NP and other classes. Electronic Colloquium on Computational Complexity (ECCC) 20, 188 (2013)

    Google Scholar 

  15. Homer, S., Kurtz, S.A., Royer, J.S.: On 1-truth-table-hard languages. Theoretical Computer Science 115(2), 383–389 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ladner, R.E.: Mitotic recursively enumerable sets. Journal of Symbolic Logic 38(2), 199–211 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  17. Ladner, R.E., Lynch, N.A.: Relativization of questions about log space computability. Mathematical Systems Theory 10, 19–32 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lynch, N.A.: Log space machines with multiple oracle tapes. Theoretical Computer Science 6, 25–39 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nguyen, D.T., Selman, A.L.: Non-autoreducible sets for NEXP. In: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS). Leibniz International Proceedings in Informatics (LIPIcs), pp. 590–601. Springer (2014)

    Google Scholar 

  20. Trakhtenbrot, B.: On autoreducibility. Dokl. Akad. Nauk SSSR 192(6), 1224–1227 (1970); Translation in Soviet Math. Dokl. 11(3), 814–817 (1970)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Julius-Maximilians-Universität Würzburg, Germany

    Christian Glaßer & Maximilian Witek

Authors
  1. Christian Glaßer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maximilian Witek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Eötvös Loránd University, Pázmány Péter sétány 1/C, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  2. Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Helmholtzplatz, 598693, Ilmenau, Germany

    Martin Dietzfelbinger

  3. Institute of Informatics, Szeged University, Tisza Lajos krt. 103, 6720, Szeged, Hungary

    Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glaßer, C., Witek, M. (2014). Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44465-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44464-1

  • Online ISBN: 978-3-662-44465-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation