01152cam2 22003131 450 SOBE0004760820150610111504.020150610f0000 |||||ita|0103 baengUSMicropaediaready reference and indexChicago [etc.]Encyclopaedia Britannica001SOBE000475782001 <<The >>new encyclopaedia Britannica : in 30 volumes001SOBE000476092000 1: A-Bib001SOBE000476102000 2: Bibai-Coleman001SOBE000476112000 3: Colemani-Exclusi001SOBE000476132000 4: Excom-Hermosil001SOBE000476142000 5: Hermoup-lally001SOBE000476152000 6: Lalo-Montpar001SOBE000476162000 7: Montpel-Piranesi001SOBE000476172000 8: Piranha-Scurfy001SOBE000476182000 9: Scurlock-Tirah001SOBE000476192000 10: Tirane-Zywny ; AddendaITUNISOB20150610RICASOBE00047608M 102 Monografia moderna SBNMMicropaedia1407592UNISOB03601nam 2200757 a 450 991096637260332120210514021546.0978140084661014008466179781299156562129915656810.1515/9781400846610(CKB)2550000001001307(EBL)1105994(OCoLC)828869723(SSID)ssj0000822001(PQKBManifestationID)11448465(PQKBTitleCode)TC0000822001(PQKBWorkID)10756188(PQKB)11221407(MdBmJHUP)muse43258(DE-B1597)453875(OCoLC)979970303(DE-B1597)9781400846610(Au-PeEL)EBL1105994(CaPaEBR)ebr10658393(CaONFJC)MIL446906(PPN)199244928(PPN)187961360(FR-PaCSA)88838069(MiAaPQ)EBC1105994(Perlego)735680(FRCYB88838069)88838069(EXLCZ)99255000000100130720121227d2013 uy 0engurcn|||||||||txtccrThe golden ticket P, NP, and the search for the impossible /Lance FortnowCourse BookPrinceton Princeton University Press20131 online resource (189 p.)Description based upon print version of record.9780691175782 0691175780 9780691156491 0691156492 Includes bibliographical references and index.Front matter --Contents --Preface --Chapter 1 The Golden Ticket --Chapter 2 The Beautiful World --Chapter 3 P and NP --Chapter 4 The Hardest Problems in NP --Chapter 5 The Prehistory of P versus NP --Chapter 6 Dealing with Hardness --Chapter 7 Proving P ≠ NP --Chapter 8 Secrets --Chapter 9 Quantum --Chapter 10 The Future --Acknowledgments --Chapter Notes and Sources --Index"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--Provided by publisher.NP-complete problemsComputer algorithmsNP-complete problems.Computer algorithms.511.3/52COM051300MAT015000MAT017000MAT034000bisacshFortnow Lance1963-1797625MiAaPQMiAaPQMiAaPQBOOK9910966372603321The golden ticket4340023UNINA