Moore, Cristopher.
The nature of computation / Computation Cristopher Moore, Stephan Mertens. - Oxford [England] ; New York : Oxford University Press, 2011. - xvii, 985 p. : ill. ; 24 cm.
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.
9780199233212 (acidfree paper) 0199233217 (acidfree paper)
2011288098
GBA8A4966 bnb
014707632 Uk
Computational complexity.
QA267.7 / .M66 2011
511.3/52
The nature of computation / Computation Cristopher Moore, Stephan Mertens. - Oxford [England] ; New York : Oxford University Press, 2011. - xvii, 985 p. : ill. ; 24 cm.
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.
9780199233212 (acidfree paper) 0199233217 (acidfree paper)
2011288098
GBA8A4966 bnb
014707632 Uk
Computational complexity.
QA267.7 / .M66 2011
511.3/52
