Mohlo by se vám také líbit

Více informací o knize P, NP, and NP-Completeness

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 409 bodů

Anotace knihy

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: P, NP, and NP-Completeness
• Podnázev: The Basics of Computational Complexity
• Autor: Oded Goldreich
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 216
• EAN: 9780521192484
• ISBN: 052119248X
• ID: 02025345
• Nakladatelství: Cambridge University Press
• Hmotnost: 490 g
• Rozměry: 229 × 147 × 18 mm
• Datum vydání: 16. August 2010

Oblíbené z jiného soudku

---

---

---