Free Shipping to all UK customers for orders over £25.00
Free Shipping to all UK customers for orders over £25.00
Free Shipping to all UK customers for orders over £25.00
Product Categories
My Shopping Cart
You shopping cart is empty
You may browse our offerings to locate what you're searching for, then put it in your shopping cart.
P, NP, and NP-Completeness
Usually dispatched within 3 - 5 business days.
£ 136.80
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.