P, NP, and NP-Completeness: The Basics of Computational Complexity - Goldreich, Oded (Weizmann Institute of Science, Israel) - Books - Cambridge University Press - 9780521122542 - August 16, 2010
In case cover and title do not match, the title is correct

Goldreich, Oded (Weizmann Institute of Science, Israel)
P, NP, and NP-Completeness: The Basics of Computational Complexity

Price
$ 70.99
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 3 - 9

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Also available as:

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.

216 pages, 18 b/w illus. 94 exercises

Media Books     Paperback Book   (Book with soft cover and glued back)
Released August 16, 2010
ISBN13 9780521122542
Publishers Cambridge University Press
Pages 216
Dimensions 156 × 228 × 13 mm   ·   336 g
Language English  

More by Goldreich, Oded (Weizmann Institute of Science, Israel)

Show all

Mere med samme udgiver

See all of Goldreich, Oded (Weizmann Institute of Science, Israel) ( e.g. Paperback Book and Hardcover Book )