English
LOOKING TO PLACE A BULK ORDER?CLICK HERE
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
About The Book
Description
Author
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.
Details
ISBN 13
9780521122542
Publication Date
-21-10-2010
Pages
-216
Weight
-299 grams
Dimensions
-152x229x12.53 mm
