Computational complexity theory has developed rapidly in the past three decades. The list of surprising and fundamental results proved since 1990 alone could fill a book: these include new probabilistic definitions of classical complexity classes (IP = PSPACE and the PCP Theorems) and their implicat
Computational complexity: A modern approach
β Scribed by Sanjeev Arora, Boaz Barak
- Book ID
- 127424904
- Publisher
- Cambridge University Press
- Year
- 2009
- Tongue
- English
- Weight
- 3 MB
- Edition
- 1
- Category
- Library
- ISBN
- 0521424267
No coin nor oath required. For personal study only.
β¦ Synopsis
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.
π SIMILAR VOLUMES
There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we wa
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computatio