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

 Title P, NP, and NPCompleteness: The Basics of Computational Complexity
 Author(s) Oded Goldreich
 Publisher: Cambridge University Press; 1 edition (August 16, 2010)
 Paperback 214 pages
 eBook Online, PostScript (PS), and PDF files
 Language: English
 ISBN10: 0521122546
 ISBN13: 9780521122542
 Share This:
Book Description
This undergraduate introduction to computational complexity offers a wide perspective on two central issues in theoretical computer science. The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the PversusNP Question and the theory of NPcompleteness.
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




















