Skip to main content
SpringerLink
Log in

Introduction to Autoreducibility and Mitoticity

  • Chapter
  • First Online:
Book cover Computability and Complexity

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

Abstract

We survey results on these concepts, discover surprising similarities, and, in particular explain why autoreducibility might someday separate complexity classes.

Birthday Acknowledgement: Rod Downey, whose birthday we celebrate, is the author of several papers on mitotic sets and splittings: [Dow85, Dow97, DRW87, DS89, DS93b, DS93a, DS98, DW86].

Happy Birthday, Rod!

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    By now researchers favor the term “computably enumerable” over “recursively enumerable.” However, it is still standard that \(\mathrm {RE}\) denotes the class of c.e. sets.

References

  1. Ambos-Spies, K.: P-mitotic sets. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds.) LaM 1983. LNCS, vol. 171, pp. 1–23. Springer, Heidelberg (1984). doi:10.1007/3-540-13331-3_30

    Chapter  Google Scholar 

  2. Berman, L.: Polynomial reducibilities and complete sets. Ph.D. thesis, Cornell University, Ithaca, NY (1977)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Buhrman, H., Homer, S., Torenvliet, L.: Completeness for nondeterministic complexity classes. Math. Syst. Theory 24(3), 179–200 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Buhrman, H., Torenvliet, L.: A Post’s program for complexity theory. Bull. EATCS 85, 41–51 (2005)

    MathSciNet  MATH  Google Scholar 

  7. Downey, R., Homer, S., Gasarch, W., Moses, M.: On honest polynomial reductions, relativizations, and P=NP. In: IEEE Structure in Complexity Theory Conference, pp. 196–207 (1989)

    Google Scholar 

  8. Downey, R.G.: The degrees of r.e. sets without the universal splitting property. Trans. Am. Math. Soc. 291(1), 337–351 (1985)

    MathSciNet  MATH  Google Scholar 

  9. Downey, R.G.: On the universal splitting property. Math. Log. Q. 43, 311–320 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Downey, R.G., Remmel, J.B., Welch, L.V.: Degrees of splittings and bases of recursively enumerable subspaces. Trans. Am. Math. Soc. 302(2), 683–714 (1987)

    MathSciNet  MATH  Google Scholar 

  11. Downey, R.G., Slaman, T.A.: Completely mitotic r.e. degrees. Ann. Pure Appl. Logic 41(2), 119–152 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  12. Downey, R.G., Stob, M.: Friedberg splittings of recursively enumerable sets. Ann. Pure Appl. Logic 59(3), 175–199 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  13. Downey, R.G., Stob, M.: Splitting theorems in recursion theory. Ann. Pure Appl. Logic 65(1), 1–106 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Downey, R.G., Shore, R.A.: Splitting theorems and the jump operator. Ann. Pure Appl. Logic 94(1–3), 45–52 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Downey, R.G., Welch, L.V.: Splitting properties of r. e. sets, degrees. J. Symbolic Logic 51(1), 88–109 (1986)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. 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. LNCS, vol. 7965, pp. 473–484. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39206-1_40

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Homer, S.: Minimal degrees for polynomial reducibilities. J. ACM 34(2), 480–491 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kurtz, S.: Private communication to Buhrman and Torenvliet [BT05] (2005)

    Google Scholar 

  22. Ladner, R.: Mitotic recursively enumerable sets. J. Symbolic Logic 38(2), 199–211 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  23. Myhill, J.: Creative sets. Math. Logic Q. 1(2), 97–108 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  24. Nguyen, D., Selman, A.: Structural properties of nonautoreducible sets. ACM Trans. Comput. Theory 8(3) (2016). Article No. 11

    Google Scholar 

  25. Ogiwara, M., Watanabe, O.: On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM J. Comput. 20(3), 471–483 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  26. Trahtenbrot, B.: On autoreducibility. Dokl. Akad. Nauk SSSR 192, 1224–1227 (1970). (Translation in Soviet Math. Dokl. 11: 814–817 (1970))

    MathSciNet  Google Scholar 

  27. Yao, A.: Coherent functions and program checkers. In: Proceedings of the 22nd Annual Symposium on Theory of Computing, pp. 89–94 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Christian Glaßer & Maximilian Witek

  2. LogicBlox Inc., Atlanta, USA

    Dung T. Nguyen

  3. University at Buffalo, Buffalo, USA

    Alan L. Selman

Authors
  1. Christian Glaßer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dung T. Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alan L. Selman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maximilian Witek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alan L. Selman .

Editor information

Editors and Affiliations

  1. Victoria University of Wellington, Wellington, New Zealand

    Adam Day

  2. University of Bergen, Bergen, Norway

    Michael Fellows

  3. Victoria University of Wellington, Wellington, New Zealand

    Noam Greenberg

  4. University of Auckland, Auckland, New Zealand

    Bakhadyr Khoussainov

  5. Massey University, Auckland, New Zealand

    Alexander Melnikov

  6. University of Bergen, Bergen, Norway

    Frances Rosamond

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Glaßer, C., Nguyen, D.T., Selman, A.L., Witek, M. (2017). Introduction to Autoreducibility and Mitoticity. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50062-1_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50061-4

  • Online ISBN: 978-3-319-50062-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation