P, Np, and Np-Completeness: The Basics of Computational Complexity

Description

Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.

Product details

EAN/ISBN:: 9780521122542
Edition:: Illustrated
Format:: Illustriert
Medium:: Paperback
Number of pages:: 214
Publication date:: 2010-10-21
Publisher:: Cambridge University Press

EAN/ISBN:: 9780521122542
Edition:: Illustrated
Format:: Illustriert
Medium:: Paperback
Number of pages:: 214
Publication date:: 2010-10-21
Publisher:: Cambridge University Press

Shipping

Buy on Amazon

The edition supplied may vary.

Currently sold out

More from Oded Goldreich

Computational Complexity …

Oded Goldreich

€85.59

Modern Cryptography, Prob…

Oded Goldreich

€128.39

Studies in Complexity and…

Oded Goldreich

€96.29

Foundations of Cryptograp…

Oded Goldreich

€57.14

Probabilistic Proof Syste…

Oded Goldreich

€87.80

Computational Complexity:…

Oded Goldreich

€90.60

Customer Service

Hotline

+49 30 488 288 200
Monday - Friday: 09.00 - 18.00 hr

International

Order safely

medimops magazine

The new medimops magazine

About us

Newsletter

Special offers, vouchers and much more! Subscribe to the newsletter and get a one-off 10% discount on your next purchase. By subscribing to the newsletter, you consent to your data being used by advertising partners for newsletter tracking and cross-channel advertising purposes in order to provide you with personalized recommendations and advertising. You can revoke your consent at any time with future effect. You can find further information in the data protection declaration.

Do you want to find out more?

Secure payment

Shipping partner

You can also find us here