ISBN 9780511761355 is currently unpriced. Please contact us for pricing.
Available options are listed below:
Available options are listed below:
P, Np, and Np-Completeness: The Basics of Computational Complexity
| AUTHOR | Goldreich, Oded |
| PUBLISHER | Cambridge University Press (06/05/2012) |
| PRODUCT TYPE | eBook (Open Ebook) |
Description
Show More
Product Format
Product Details
ISBN-13:
9780511761355
ISBN-10:
051176135X
Content Language:
English
More Product Details
Carton Quantity:
0
Feature Codes:
Bibliography
Country of Origin:
US
Subject Information
BISAC Categories
Computers | General
Dewey Decimal:
005.1
Descriptions, Reviews, Etc.
Author:
Goldreich, Oded
Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an Incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity, and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Computational Complexity: A Conceptual Perspective, and the two-volume work Foundations of Cryptography.
Show More