Skip to main content

Basic Results of Complexity Theory

  • Chapter
  • First Online:
Computability and Complexity Theory

Part of the book series: Texts in Computer Science ((TCS))

  • 3459 Accesses

Abstract

We begin our study of complexity theory by examining the fundamental properties of complexity classes. These results apply to all complexity classes and show that the definitions of these classes are invariant under small changes in the time or space bounds of the Turing machines that define them. We will prove general relationships between time- and space-bounded complexity classes. These consist of inclusions between some classes and separations of other classes. Then we will apply the methods and results of these general relationships to important specific cases in order to establish relationships between the central standard complexity classes we defined in the previous chapter. In order to begin this study we need to understand some simple assertions that involve the behavior of functions at limits, so let’s review these now.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Steven Homer .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Homer, S., Selman, A.L. (2011). Basic Results of Complexity Theory. In: Computability and Complexity Theory. Texts in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0682-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-0682-2_5

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4614-0681-5

  • Online ISBN: 978-1-4614-0682-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics