Items related to P, NP, and NP-Completeness: The Basics of Computational...

P, NP, and NP-Completeness: The Basics of Computational Complexity - Hardcover

Oded Goldreich

 
9780521192484: P, NP, and NP-Completeness: The Basics of Computational Complexity
Hardcover
ISBN 10: 052119248X ISBN 13: 9780521192484
Publisher: Cambridge University Press, 2010

Synopsis

Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.

"synopsis" may belong to another edition of this title.

About the Author

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, Probabilistic Proofs and Pseudorandomness, the two-volume work Foundations of Cryptography, and Computational Complexity: A Conceptual Perspective.

"About this title" may belong to another edition of this title.

Publisher
Cambridge University Press
Publication date
2010
Language
English
ISBN 10 
052119248X
ISBN 13 
9780521192484
Binding
Hardcover
Edition number
1
Number of pages
216