122,30 €
Versandkostenfrei per Post / DHL
Aktuell nicht verfügbar
computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so
fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long
wanted to understand this subject, and experts who want to fall in love with this field all over again.
computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so
fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long
wanted to understand this subject, and experts who want to fall in love with this field all over again.
Stephan Mertens got his Diploma in Physics in 1989, and his Ph.D. in Physics in 1991, both from Georg-August University Göttingen. He holds scholarships from the "Studienstiftung des Deutschen Volkes", Germany's most prestigious organisation sponsoring the academically gifted. After his Ph.D. he worked for three years in the software industry before he joined the faculty of Otto-von-Guericke University Magdeburg as a theoretical physicist. His research focuses on disordered systems in statistical mechanics, average case complexity of algorithms, and parallel computing.
- 1: Prologue
- 2: The Basics
- 3: Insights and Algorithms
- 4: Needles in a Haystack: The class NP
- 5: Who is the Hardest One of All: NP-Completeness
- 6: The Deep Question: P vs. NP
- 7: Memory, Paths and games
- 8: Grand Unified Theory of Computation
- 9: Simply the Best: Optimization
- 10: The Power of Randomness
- 11: Random Walks and Rapid Mixing
- 12: Counting, Sampling, and Statistical Physics
- 13: When Formulas Freeze: Phase Transitions in Computation
- 14: Quantum Computing
- 15: Epilogue
- 16: Appendix: Mathematical Tools
| Erscheinungsjahr: | 2013 |
|---|---|
| Fachbereich: | Theoretische Physik |
| Genre: | Importe, Physik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: | Gebunden |
| ISBN-13: | 9780199233212 |
| ISBN-10: | 0199233217 |
| Sprache: | Englisch |
| Einband: | Gebunden |
| Autor: | Moore, Cristopher |
| Hersteller: | ACADEMIC |
| Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
| Maße: | 252 x 194 x 58 mm |
| Von/Mit: | Cristopher Moore |
| Erscheinungsdatum: | 25.07.2013 |
| Gewicht: | 2,099 kg |
Ähnliche Produkte
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage