P, Np, and Np-Completeness: The Basics of Computational Complexity
| AUTHOR | Goldreich, Oded |
| PUBLISHER | Cambridge University Press (08/16/2010) |
| PRODUCT TYPE | Paperback (Paperback) |
Description
Show More
Product Format
Product Details
ISBN-13:
9780521122542
ISBN-10:
0521122546
Binding:
Paperback or Softback (Trade Paperback (Us))
Content Language:
English
More Product Details
Page Count:
216
Carton Quantity:
38
Product Dimensions:
5.90 x 0.60 x 8.90 inches
Weight:
0.65 pound(s)
Feature Codes:
Bibliography,
Index,
Table of Contents,
Textbook,
Illustrated
Country of Origin:
US
Subject Information
BISAC Categories
Computers | General
Dewey Decimal:
005.1
Library of Congress Control Number:
2010023587
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
List Price $55.00
Your Price
$54.45