Moore Cristopher Mertens Stephan. <br/><br/>
The Nature of Computation 
 Computation 

 - New York   Oxford University Press,  2011. 
 - xvii, 985 p.  
<br/><br/>Includes bibliographical references (p. 945-973) and index. 
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9780199233212  
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computational complexity.
<br/><br/><label>Dewey Class. No.: </label>005.131  / MOO/N