The nature of computation - Moore, Cristopher; Mertens, Stephan (Oxford [England] ; New York : Oxford University Press, 2011)
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.
Includes bibliographical references (p. 945-973) and index.
Keywords: Computational complexity