Logo

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

Large book cover: P, NP, and NP-Completeness: The Basics of Complexity Theory

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

Publisher: Cambridge University Press
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.

Home page url

Download or read it online for free here:
Download link
(1.9MB, PS)

Similar books

Book cover: Algorithmic Randomness and ComplexityAlgorithmic Randomness and Complexity
by - Springer
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.
(4805 views)
Book cover: From Complexity to CreativityFrom Complexity to Creativity
by - 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.
(9756 views)
Book cover: Communication Complexity (for Algorithm Designers)Communication Complexity (for Algorithm Designers)
by - 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.
(1080 views)
Book cover: Lecture Notes on Computational ComplexityLecture Notes on Computational Complexity
by
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.
(10294 views)