Abstract
We introduce NP-completeness. We prove the Cook-Levin Theorem. Using it we prove many natural problems are NP-complete, and using similar ideas show QBF is PSPACE complete, and then show several natural problems are PSPACE complete. We prove Savitch’s Theorem showing that NPSPACE=PSPACE. We finish by looking at advice classes, BPP and randomization.
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). NP- and PSPACE-Completeness. In: Computability and Complexity. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-53744-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-53744-8_7
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)