Skip to main content Accessibility help
×
Home
Hostname: page-component-99c86f546-t82dr Total loading time: 0.405 Render date: 2021-12-04T04:36:29.982Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true, "newUsageEvents": true }

Book contents

Collapsing Polynomial-Time Degrees

Published online by Cambridge University Press:  31 March 2017

Klaus Ambos-Spies
Affiliation:
Universität Heidelberg
Levke Bentzien
Affiliation:
Universität Heidelberg
Peter A. Fejer
Affiliation:
University of Massachusetts at Boston
Wolfgang Merkle
Affiliation:
Universität Heidelberg
Frank Stephan
Affiliation:
Universität Heidelberg
Samuel R. Buss
Affiliation:
University of California, San Diego
Petr Hájek
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Pavel Pudlák
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. E., Allender. News fromthe isomorphism front. Bulletin of the European Association for Computer Science 66:73–81, 1998.Google Scholar
2. K., Ambos-Spies. Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets. Information Processing Letters 22:113–117, 1986.Google Scholar
3. K., Ambos-Spies. Resource-bounded genericity. In: S.B., Cooper et al., editors, Computability, Enumerability, Unsolvability: Directions in Recursion Theory. London Mathematical Society Lecture Note Series 224, 1–59. Cambridge University Press, 1996.
4. L., Berman. Polynomial reducibilities and complete sets. Ph.D. dissertation, Cornell University, 1977.
5. L., Berman, J., Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing 6:305–322, 1977.Google Scholar
6. H., Buhrman. Resource Bounded Reductions. Ph.D. dissertation, Universiteit van Amsterdam, Amsterdam, 1993.
7. H., Buhrman, L., Torenvliet. Complete sets and structure in subrecursive classes. In: J.M., Larrazabal, D., Lascar, G., Mints, editors, Logic Colloquium '96, 45–77, Lecture Notes in Logic 12, Springer Verlag, 1998.
8. S.A., Fenner. Notions of resource-bounded category and genericity. Proceedings of the 6th Annual Structure in Complexity Theory Conference, 1991, 196–212, IEEE Computer Society Press, 1991.
9. S., Homer, S., Kurtz, and J., Royer. On 1-truth-table-hard languages. Theoretical Computer Science. 115:383–389, 1993.Google Scholar
10. C.G., Jockusch Jr. Semirecursive sets and positive reducibility. Transactions of the American Mathematical Society 131:420–436, 1968.Google Scholar
11. S.A., Kurtz, S.R., Mahaney, and J.S., Royer. The structure of complete degrees. In: [16], 108–146.
12. R.E., Ladner, N.A., Lynch, A.L., Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science 1:103–123, 1975.Google Scholar
13. M., Li, P., Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, 1997.
14. N., Sauer. On the density of families of sets. Journal of Combinatorial Theory, Series A, 13:145–147, 1972.Google Scholar
15. A.L., Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Mathematical Systems Theory 13:55–65, 1979.Google Scholar
16. A.L., Selman, editor. Complexity Theory Retrospective. Springer-Verlag, 1990.
17. P., Young. Juris Hartmanis: fundamental contributions to isomorphism problems. In [16], 28–58.
18. O., Watanabe. A comparison of polynomial time completeness notions. Theoretical Computer Science 54:249-265, 1987.Google Scholar

Send book to Kindle

To send this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Send book to Dropbox

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox.

Available formats
×

Send book to Google Drive

To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive.

Available formats
×