000			01018cam a2200181 a 4500
020			_a9780199233212
082	0	0	_a005.131 _bMOO/N
100	1		_aMoore Cristopher
100	1		_aMertens Stephan.
245	1	4	_aThe Nature of Computation
246	3	0	_aComputation
260			_aNew York _bOxford University Press, _c2011.
300			_axvii, 985 p.
504			_aIncludes bibliographical references (p. 945-973) and index.
505	0		_aPrologue -- 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.
650		0	_aComputational complexity.
942			_cBK
999			_c1990 _d1990