The nature of computation

Saved in:
Bibliographic Details
Main Authors: Moore Cristopher
Group Author: Mertens Stephan
Published: Oxford University Press,
Publisher Address: Oxford [England] New York
Publication Dates: 2011.
Literature type: Book
Language: English
Subjects:
Carrier Form: xvii, 985 p.: ill. ; 24 cm.
ISBN: 9780199233212 (acid-free paper)
0199233217 (acid-free paper)
Index Number: TP301
CLC: TP301.5
Call Number: TP301.5/M821
Contents: 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.