| Portion of title |
Computation |
| Contents |
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. |
| Bibliography note | Includes bibliographical references (p. 945-973) and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2011288098 |
| ISBN | 9780199233212 (acid-free paper) |
| ISBN | 0199233217 (acid-free paper) |
