The nature of computation / Cristopher Moore, Stephan Mertens.
By: Moore, Cristopher.
Contributor(s): Mertens, Stephan.
Material type: TextPublisher: Oxford [England] ; New York : Oxford University Press, 2011Description: xvii, 985 p. : UKP 62.00 ill. ; 24 cm.ISBN: 9780199233212 (acidfree paper)(hbk.); 0199233217 (acidfree paper).Other title: Computation.Subject(s): Computational complexityDDC classification: 511.3/52Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Book | Chennai Mathematical Institute General Stacks | 511.352 MOO (Browse shelf) | Checked out | 16/05/2024 | 10696 |
Browsing Chennai Mathematical Institute Shelves , Shelving location: General Stacks Close shelf browser
511.352 KOZ Theory of computation / | 511.352 KOZ Automata and computability / | 511.352 KOZ Automata and computability / | 511.352 MOO The nature of computation / | 511.352 MOS Elementary induction on abstract structures / | 511.352 STU Understanding Computation | 511.352 WEB Computability theory / |
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.