Abstract
We develop some general results on computational complexity. We show that normal methods which relativize are insufficient to decide many natural questions about complexity class separations, including P vs NP. We prove Ladner's Theorem showing that the polynomial time degrees are dense.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Downey, R. (2024). Some Structural Complexity. In: Computability and Complexity. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-53744-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-53744-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53743-1
Online ISBN: 978-3-031-53744-8
eBook Packages: Computer ScienceComputer Science (R0)