Computational complexity
- Pages
- 553
- 8 editions
- First published
- 2008
- 1 language
Join or log in to shelve and rate Free, no password.
Overview
Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.
Ratings & reviews
Log in to rate or review this book.
No written reviews yet.
Discussions
Talk about this book with other readers.
Log in to start a discussion.
No discussions yet.
Editions
Details & links
- First published
- 2008
- Pages
- 553
- Languages
- Available in 1 language
Where to buy this book: see “Buy this book”
More about this book
Read a sample, borrow it or see other editions → openlibrary.org