P, NP, and NP-Completeness : The Basics of Computational Complexity
Book Details
Format
Hardback or Cased Book
ISBN-10
052119248X
ISBN-13
9780521192484
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Aug 16th, 2010
Print length
216 Pages
Weight
490 grams
Dimensions
22.90 x 14.70 x 1.80 cms
Product Classification:
Mathematical theory of computation
Ksh 20,500.00
Manufactured on Demand
Delivery in 29 days
Delivery Location
Delivery fee: Select location
Delivery in 29 days
Secure
Quality
Fast
This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It 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.
Get P, NP, and NP-Completeness by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
