FreeComputerBooks.com
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.

 Title Computational Complexity: A Conceptual Perspective
 Author(s) Oded Goldreich
 Publisher: Cambridge University Press; 1 edition (April 28, 2008)
 Hardcover 632 pages
 eBook Online, HTML and PDF files
 Language: English
 ISBN10: 052188473X
 ISBN13: 9780521884730
 Share This:
Book Description
This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for selfstudy. It is also useful to experts, since it provides expositions of the various subareas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.
It provides very well developed material that should interest advanced students either studying or doing new work on computational complexity. It would also be a valuable text for professionals challenged with solving "hard" computing problems of intending to exploit these types of problems when designing of new types computing systems.
About the Authors Oded Goldreich is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography, and computational complexity theory. He won the Knuth Prize in 2017.
 Computational Complexity
 Algorithms and Data Structures
 Computational and Algorithmic Mathematics
 Parallel Computing and Programming




















