English
Paperback
₹4675
(All inclusive*)
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Looking to place a bulk order? SUBMIT DETAILS
Piracy-free
Assured Quality
Secure Transactions
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.
Piracy-free
Assured Quality
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Details
ISBN 13
9780521122542
Publication Date
-21-10-2010
Pages
-216
Weight
-299 grams
Dimensions
-152x229x12.53 mm
