P, Np, and Np-completeness: The Basics of Computational Complexity

Goldreich, Oded

ISBN 10: 052119248X / ISBN 13: 9780521192484

Verlag: Cambridge Univ Pr, 2010

Beschreibung

1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. This item is printed on demand.

Bestandsnummer des Verkäufers __052119248X

Bibliografische Details

• Titel: P, Np, and Np-completeness: The Basics of Computational Complexity
• Verlag: Cambridge Univ Pr
• Erscheinungsjahr: 2010
• Sprache: Englisch
• ISBN-10: 052119248X
• ISBN-13: 9780521192484
• Einband: Hardcover
• Zustand: Brand New

Über diesen Titel

Inhaltsangabe

This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It 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.

Über die Autorin bzw. den Autor

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.