Processing ......
FreeComputerBooks.com
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.
 
P, NP, and NP-Completeness: The Basics of Computational Complexity
For Weather, Flights, Runways of Airports all over the world, click here.
  • Title P, NP, and NP-Completeness: 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
  • ISBN-10: 0521122546
  • ISBN-13: 978-0521122542
  • 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 P-versus-NP Question and the theory of NP-completeness.

About the Authors
  • 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.
Reviews and Rating: Related Book Categories: Read and Download Links:
Book Categories
Other Categories
Resources and Links