Search Type
  • All
  • Subject
  • Title
  • Author
  • Publisher
  • Series Title
Search Title

Download

P, NP, and NP-Completeness

The Basics of Computational Complexity

P, NP, and NP-Completeness( )
Author: Goldreich, Oded
ISBN:978-0-521-12254-2
Publication Date:Aug 2010
Publisher:Cambridge University Press
Book Format:Paperback
List Price:USD $49.99
Book Description:

This undergraduate introduction to computational complexity offers a wide perspective on two central issues in theoretical computer science. The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness.

Book Details
Pages:216
Detailed Subjects: Computers / Machine Theory
Physical Dimensions (W X L X H):5.928 x 8.931 x 0.468 Inches
Book Weight:0.704 Pounds



Featured Books

Angels Fall
Roberts, Nora
Paperback: $16.99
Madness
Hylton, Antonia
Hardback: $30.00
Northanger Abbey
Austen, Jane
Paperback: $7.99

Rate this title:

Select your rating below then click 'submit'.






I do not wish to rate this title.