Surprise Castle
Computational Complexity

Computational Complexity - Hardcover

$96.99
$99.00
-2%
Quantity
01

Pay over time for orders over $35.00 with

Availability:In StockContributor:Oded GoldreichPublish date:2008-04-28Pages:632
Language:EnglishPublisher:Cambridge University PressISBN-13:9780521884730ISBN-10:052188473XUPC:9780521884730Book Category:Computers, MathematicsBook Subcategory:LogicSize:10.13 x 7.02 x 1.60 inchesWeight:2.7624Product ID:SCMRGBG35D
This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.
Language:EnglishPublisher:Cambridge University PressISBN-13:9780521884730ISBN-10:052188473XUPC:9780521884730Book Category:Computers, MathematicsBook Subcategory:LogicSize:10.13 x 7.02 x 1.60 inchesWeight:2.7624Product ID:SCMRGBG35D
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, Probabalistic Proofs and Pseudorandomness and the two-volume work Foundations of Cryptography.
Publisher: Cambridge University Press

Contributor(s)

Oded Goldreich

Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.

Recently Viewed

View All