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
Think Complexity: Complexity Science and Computational Modelingby Allen B. Downey - Green Tea Press
This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. The book focuses on discrete models, which include graphs, cellular automata, and agent-based models.
(11797 views)
Computability and Complexity from a Programming Perspectiveby Neil D. Jones - The MIT Press
The author builds a bridge between computability and complexity theory and other areas of computer science. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists.
(14113 views)
Complexity Theoryby Johan Håstad
This set of notes gives the broad picture of modern complexity theory, defines the basic complexity classes, gives some examples of each complexity class and proves the most standard relations. The author emphasizes the ideas involved in the proofs.
(18852 views)
Communication Complexity (for Algorithm Designers)by Tim Roughgarden - Stanford University
The two biggest goals of the course are: 1. Learn several canonical problems that have proved the most useful for proving lower bounds; 2. Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.
(8295 views)