The nature of computation / Cristopher Moore, Stephan Mertens.
By: Moore, Cristopher.
Contributor(s): Mertens, Stephan.
Publisher: Oxford [England] ; New York : Oxford University Press, 2011Description: xvii, 985 p. : ill. ; 24 cm.ISBN: 9780199233212 (acidfree paper); 0199233217 (acidfree paper).Other title: Computation.Subject(s): Computational complexityDDC classification: 511.3/52 Online resources: Full-text here| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| E-Book | Skoltech library Shelves | QA267.7 .M66 2011 (Browse shelf) | Available | |||
| Book | Skoltech library Shelves | QA267.7 .M66 2011 (Browse shelf) | Available | 2000007393 | ||
| Book | Skoltech library Shelves | QA267.7 .M66 2011 (Browse shelf) | Available | 2000007391 | ||
| Book | Skoltech library Shelves | QA267.7 .M66 2011 (Browse shelf) | Available | 2000006153 |
Browsing Skoltech library Shelves , Shelving location: Shelves Close shelf browser
| QA267.7 .M66 2011 The nature of computation / | QA267.7 .M66 2011 The nature of computation / | QA267.7 .M66 2011 The nature of computation / | QA267.7 .M66 2011 The nature of computation / | QA268 .L57 1999 Introduction to coding theory / | QA268 .R53 2008 Modern coding theory / | QA268 .S75 2006 Cryptography : |
Includes bibliographical references (p. 945-973) and index.
Prologue -- The basics -- Insights and algorithms -- Needles in a haystack : the class NP -- Who is the hardest one of all? : NP-completeness -- The deep question : P vs. NP -- The grand unified theory of computation -- Memory, paths, and games -- Optimization and approximation -- Randomized algorithms -- Interaction and pseudorandomness -- Random walks and rapid mixing -- Counting, sampling, and statistical physics -- When formulas freeze : phase transitions in computation -- Quantum computation -- Mathematical tools.
There are no comments for this item.