P, Np, and Np-Completeness - The Basics of Computational Complexity

Informationen zum 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. Klappentext Starting from the basics of computability! this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Zusammenfassung 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. Inhaltsverzeichnis 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.

Product details

• Authors: Oded Goldreich, Oded (Weizmann Institute of Science Goldreich, Goldreich Oded
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 16.08.2010
• EAN: 9780521192484
• ISBN: 978-0-521-19248-4
• No. of pages: 216
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > General, dictionaries; COMPUTERS / General, Algorithms & data structures, Mathematical theory of computation