Item Image
Title The Golden ticket : P, NP, and the search for the impossible / Lance Fortnow.
Author Fortnow, Lance, 1963- author.
Publication Princeton, N.J. : Princeton University Press, [2013]
Copyright date ©2013
Description x, 176 pages : illustrations, maps ; 24 cm
Call # 511.352 F
Note Subtitle on cover: "Traveling salesman -- Map coloring -- Sudoku-- Clique."
Summary "The P-NP problem--[whether all problems can be made solvable by computer algorithm]--is the most important open problem in computer science, if not all of mathematics. [The book] traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples from a variety of disciplines, including economics, physics, and biology. On the other hand, if there were no hard problems, we would have no privacy."-- From jacket.
Bibliography Includes bibliographical references (pages 165-169) and index.
Contents The golden ticket -- The beautiful world -- P and NP -- The hardest problems in NP -- The prehistory of P versus NP -- Dealing with hardness -- Proving P ̀ NP -- Secrets -- Quantum -- The future.
Subject NP-complete problems.
Computer algorithms.
ISBN 0691156492 (hardback)
9780691156491 (hardback)
0691175780 (paperback) :
9780691175782 (paperback) :

Location CALL # Status Message
 Central 2nd Fl - SST Non-Fiction  511.352 F    DUE 03-15-21