{"text_format":"5","workbook":"xls","n_sheets":1,"sheets":["report2"],"props":{"last_modified_by":"sharecat"},"not_rendered":{"external_links":1,"defined_names":1},"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":19,"n_cols":5,"rows_kept":19,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3],[13,2,13,3],[17,2,17,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910818849503321"]
[null,null,"Autore",null,"Fortnow Lance <1963->"]
[null,null,"Titolo",null,"The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow"]
[null,null,"Pubbl/distr/stampa",null,"Princeton, : Princeton University Press, 2013"]
[null,null,"ISBN",null,"1-4008-4661-7"]
[{"$nulls":4},"1-299-15656-8"]
[null,null,"Edizione",null,"[Course Book]"]
[null,null,"Descrizione fisica",null,"1 online resource (189 p.)"]
[null,null,"Classificazione",null,"COM051300MAT015000MAT017000MAT034000"]
[null,null,"Disciplina",null,"511.3/52"]
[null,null,"Soggetti",null,"NP-complete problems"]
[{"$nulls":4},"Computer algorithms"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[{"$nulls":3},"Livello bibliografico","Monografia"]
[{"$nulls":3},"Note generali","Description based upon print version of record."]
[{"$nulls":3},"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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"]
[{"$nulls":3},"Sommario/riassunto","\"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\"--"]