| Computational Complexity Contributor(s): Goldreich, Oded (Author) |
|
 |
ISBN: 052188473X ISBN-13: 9780521884730 Publisher: Cambridge University Press OUR PRICE: $88.35 Product Type: Hardcover - Other Formats Published: May 2008 |
| Additional Information |
| BISAC Categories: - Computers - Mathematics | Logic |
| Dewey: 511.352 |
| LCCN: 2008006750 |
| Physical Information: 1.6" H x 7.02" W x 10.13" (2.76 lbs) 632 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |
Contributor Bio(s): 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. |