Skip to main content
SpringerLink
Log in
Book cover

Recursion Theory Week pp 1–22Cite as

Honest polynomial reductions and exptally sets

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1432))

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   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
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. K. Ambos-Spies, Honest Polynomial Reducibilities, Recursively Enumerable Sets, and the P=?NP Problem, Second Annual Structure in Complexity Theory Conference, 60–68.

    Google Scholar 

  2. K. Ambos-Spies, Honest Polynomial Time Reducibilities and the P=?NP Problem, JCSS 39, 250–281.

    Google Scholar 

  3. T. Baker, J. Gill and R. Solovay, Relativizations of P=?NP Question, SIAM Journal of Computer Science 1, 305–322.

    Google Scholar 

  4. S.I. Breidbart, On Splitting Recursive Sets, JCSS 17, 56–64.

    Google Scholar 

  5. R. Downey, On Computational Complexity and Honest Polynomial Degrees, Theoretical Computer Science, to appear.

    Google Scholar 

  6. R. Downey and M. Moses, On the Structure of Honest Polym-degrees, Manuscript.

    Google Scholar 

  7. R. Downey, W. Gasarch, S. Homer and M. Moses, On Honest Polynomial Reductions, Relativizations, and P = NP, Fourth Annual Structure in Complexity Theory Conference, 196–207.

    Google Scholar 

  8. W.I. Gasarch and S. Homer, Recursion Theoretic Properties of Minimal Honest Polynomial Degrees, University of Maryland Computer Science Department, TR 1803. Also Boston University TR 87-005.

    Google Scholar 

  9. S. Homer, Minimal Polynomial Degrees of Non-Recursive Sets, Lecture Notes in Mathematics No. 1141 (Recursion Theory Week), 193–202.

    Google Scholar 

  10. S. Homer, Minimal Degrees for Polynomial Reducibilities, Journal of the Association of Computing Machinery 34, 480–491.

    Google Scholar 

  11. C. Jockusch, personal communication.

    Google Scholar 

  12. R. Ladner, On the Structure of Polynomial Time Reducibility, Journal of the Assoc. for Computing Mach. 22, No. 1, 155–171.

    Google Scholar 

  13. T.J. Long and S. Homer, Honest Polynomial Degrees and P=?NP, Theoretical Computer Science 51, 265–280.

    Google Scholar 

  14. D.A. Martin, Classes of Recursively Enumerable Sets and Degrees of Unsolvability, Z. Math. Logik Grundlag. Math. 12, 295–310.

    Google Scholar 

  15. R.I. Soare, Recursively Enumerable Sets and Degrees, Springer Verlag (Ω Series), Berlin and New York, 1987.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität Heidelberg, Heidelberg, West Germany

    Klaus Ambos-Spies

  2. Computer Science Department, Boston University, 02215, Boston, MA, USA

    Steven Homer

  3. Institute of Software, Academia Sinica, 100080, Beijing, China

    Dongping Yang

Authors
  1. Klaus Ambos-Spies
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven Homer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dongping Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Ambos-Spies Gert H. Müller Gerald E. Sacks

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Ambos-Spies, K., Homer, S., Yang, D. (1990). Honest polynomial reductions and exptally sets. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086110

Download citation

  • DOI: https://doi.org/10.1007/BFb0086110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52772-5

  • Online ISBN: 978-3-540-47142-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation