Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome! Sanjeev Arora and Boaz Barak Princeton University complexitybook@gmail.
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 (I
A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity
给出目录，内容大家自己看吧。540页。 Contents PART I: ALGORITHMS 1 Problem and algorithms 2 Turing machine 3 Gomputability PART II: LOGIC 4 Boolean logic 5 First-order logic 6 Undecidability in logic PART III P AND NP 7 Relations between complexity classes 8 Reducti
