Skip to main content

Minimal polynomial degrees of nonrecursive sets

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

Keywords

  • Polynomial Time
  • Minimal Degree
  • Recursion Theory
  • Turing Reducibility
  • Priority Argument

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

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

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  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

Authors

Editor information

Editors and Affiliations

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