An electronic copy of book is available for Library Members Sign in to view the book
A graduate-level textbook offering a rigorous and conceptual introduction to computational complexity theory. The book emphasizes clarity and depth, covering fundamental topics such as time and space complexity, reducibility, probabilistic computation, interactive proofs, and inapproximability. It is designed for students and researchers seeking a modern, theoretically grounded treatment of complexity.
Sub Title:
Edition:
Volume:
Publisher: Cambridge University Press
Publishing Year: 2008
ISBN: 978-0-521-88473-0
Pages: 458