Skip to main content
SpringerLink
Log in

Minimal polynomial degrees of nonrecursive sets

  • Conference paper
  • First Online:
Recursion Theory Week

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

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook, S.A., The complexity of theorem-proving procedures, Third Annual ACM Symposium on Theory of Computing (1971).

    Google Scholar 

  2. Goldreich, O., Goldwasser, S., and Micali, S., How to construct random functions, preprint, 1983.

    Google Scholar 

  3. Homer, S., Minimal degrees for polynomial reducibilities, submitted for publication.

    Google Scholar 

  4. Ladner, R.E., On the structure of polynomial time reducibility, J. ACM 22 (1975), 155–171.

    Article  MathSciNet  MATH  Google Scholar 

  5. Sacks, G.E., A minimal degree less than 0′, Bulletin of the AMS, vol 67, 1961, pp 416–419.

    Article  MathSciNet  MATH  Google Scholar 

  6. Yao, A.C., Theory and applications of trapdoor functions, Proc. 23rd Symp. on Foundations of Computer Science, 1982, pp 80–91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Department of Mathematics, Boston University, 02215, Boston, Mass.

    Steven Homer

Authors
  1. Steven Homer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heinz-Dieter Ebbinghaus Gert H. Müller Gerald E. Sacks

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Homer, S. (1985). Minimal polynomial degrees of nonrecursive sets. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076221

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15673-4

  • Online ISBN: 978-3-540-39596-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation