The nature of computation / Cristopher Moore, Stephan Mertens.
By: Moore, Cristopher.
Contributor(s): Mertens, Stephan.
Material type:
Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Book | Chennai Mathematical Institute General Stacks | 511.352 MOO (Browse shelf) | Available | 10696 |
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.