**P, NP, and NP-Completeness: The Basics of Complexity Theory**

by Oded Goldreich

**Publisher**: Cambridge University Press 2010**ISBN/ASIN**: 0521122546**ISBN-13**: 9780521122542**Number of pages**: 190

**Description**:

The focus of this book is on the P-vs-NP Question, which is the most fundamental question of computer science, and on the theory of NP-completeness, which is its most influential theoretical discovery. The book also provides adequate preliminaries regarding computational problems and computational models.

Download or read it online for free here:

**Download link**

(1.9MB, PS)

## Similar books

**Specifying Systems**

by

**Leslie Lamport**-

**Addison-Wesley Professional**

This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.

(

**15419**views)

**Foundations of Cryptography**

by

**Oded Goldreich**-

**Cambridge University Press**

The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.

(

**16518**views)

**From Complexity to Creativity**

by

**Ben Goertzel**-

**Plenum Press**

This text applies the concepts of complexity science to provide an explanation of all aspects of human creativity. The book describes the model that integrates ideas from computer science, mathematics, neurobiology, philosophy, and psychology.

(

**15284**views)

**Lecture Notes on Computational Complexity**

by

**Luca Trevisan**

Notes from a graduate courses on Computational Complexity. The first 15 lectures cover fundamentals, the remaining is advanced material: Hastad's optimal inapproximability results, lower bounds for parity in bounded depth-circuits, and more.

(

**14912**views)