TY - BOOK UR - http://lib.ugent.be/catalog/ebk01:2550000001001307 ID - ebk01:2550000001001307 LA - eng TI - The Golden Ticket : P, NP, and the Search for the Impossible PY - 2013 SN - 9781400846610 AU - Fortnow, Lance, author. AB - 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. ER -Download RIS file
04934nam a2200865 i 4500 | |||
001 | 9781400846610 | ||
003 | DE-B1597 | ||
005 | 20151005101939.0 | ||
006 | m||||||||||||||||| | ||
007 | cr |n||||||||n | ||
008 | 151005s2013||||||||||||o|||||||||||eng|| | ||
020 | a 9781400846610 | ||
024 | 7 | a 10.1515/9781400846610 2 doi | |
035 | a (DE-B1597)453875 | ||
035 | a (OCoLC)820123482 | ||
035 | a (OCoLC)847037098 | ||
040 | a IN-ChSCO b eng c IN-ChSCO e rda | ||
041 | a eng | ||
050 | 4 | a QA267.7 | |
050 | a QA267.7 b .F67 2013 | ||
072 | 7 | a COM x 051300 2 bisacsh | |
072 | 7 | a COM051300 2 bisacsh | |
072 | 7 | a MAT x 015000 2 bisacsh | |
072 | 7 | a MAT x 017000 2 bisacsh | |
072 | 7 | a MAT x 034000 2 bisacsh | |
072 | 7 | a MAT x 042000 2 bisacsh | |
082 | a 511.3/52 2 23 | ||
082 | 4 | a 511.3/52 2 23 | |
100 | 1 | a Fortnow, Lance, e author. | |
245 | 1 | 4 | a The Golden Ticket : b P, NP, and the Search for the Impossible / c Lance Fortnow. |
264 | 1 | a Princeton, N.J. : b Princeton University Press, c [2013]. | |
264 | 4 | c ©2013. | |
300 | a 1 online resource(192p.) : b illustrations. | ||
336 | a text 2 rdacontent | ||
337 | a computer 2 rdamedia | ||
338 | a online resource 2 rdacarrier | ||
347 | a text file b PDF 2 rda | ||
505 | t Frontmatter -- t Contents -- t Preface -- t Chapter 1 The Golden Ticket -- t Chapter 2 The Beautiful World -- t Chapter 3 P and NP -- t Chapter 4 The Hardest Problems in NP -- t Chapter 5 The Prehistory of P versus NP -- t Chapter 6 Dealing with Hardness -- t Chapter 7 Proving P ≠ NP -- t Chapter 8 Secrets -- t Chapter 9 Quantum -- t Chapter 10 The Future -- t Acknowledgments -- t Chapter Notes and Sources -- t Index. | ||
520 | a 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. | ||
533 | a Electronic reproduction. b Princeton, N.J. : c Princeton University Press, d 2013. n Mode of access: World Wide Web. n System requirements: Web browser. n Access may be restricted to users at subscribing institutions. | ||
538 | a Mode of access: Internet via World Wide Web. | ||
545 | a FortnowLance: Lance Fortnow is professor and chair of the School of Computer Science at the Georgia Institute of Technology. He founded and coauthors the Computational Complexity blog. | ||
546 | a In English. | ||
588 | a Description based on online resource; title from PDF title page (publisher’s Web site, viewed October 05 2015) | ||
650 | a Algorithmentheorie. | ||
650 | a Computer algorithms x Electronic books. | ||
650 | a Computer algorithms. | ||
650 | a NP-complete problems. | ||
650 | a NP-vollständiges Problem. | ||
650 | a P-vollständiges Problem. | ||
650 | 4 | a Computer Science. | |
650 | 4 | a Mathematik. | |
650 | 4 | a Programming and Languages. | |
650 | 4 | a Social Sciences. | |
650 | 7 | a COMPUTERS x Programming x Algorithms. 2 bisacsh. | |
650 | 7 | a MATHEMATICS x History & Philosophy. 2 bisacsh. | |
650 | 7 | a MATHEMATICS x Linear Programming. 2 bisacsh. | |
650 | 7 | a MATHEMATICS x Mathematical Analysis. 2 bisacsh. | |
773 | 8 | i Title is part of eBook package: d De Gruyter t Princeton eBook Package Backlist 2000-2013 z 978-3-11-044250-2 | |
773 | 8 | i Title is part of eBook package: d De Gruyter t Princeton eBook Package Backlist 2000-2014 z 978-3-11-045953-1 | |
856 | 4 | u https://doi.org/10.1515/9781400846610 | |
856 | 4 | 2 | 3 Cover u https://www.degruyter.com/doc/cover/9781400846610.jpg |
912 | a 978-3-11-044250-2 Princeton eBook Package Backlist 2000-2013 | ||
912 | a 978-3-11-045953-1 Princeton eBook Package Backlist 2000-2014 | ||
912 | a GBV-deGruyter-alles | ||
912 | a GBV-deGruyter-PDA12STME | ||
912 | a GBV-deGruyter-PDA13ENGE | ||
912 | a GBV-deGruyter-PDA14ALL | ||
912 | a GBV-deGruyter-PDA15STM | ||
912 | a GBV-deGruyter-PDA18STMEE | ||
912 | a GBV-deGruyter-PDA1ALL | ||
912 | a GBV-deGruyter-PDA3STM | ||
912 | a GBV-deGruyter-PDA5EBK | ||
912 | a GBV-deGruyter-PDA7ENG | ||
912 | a GBV-deGruyter-PDA9PRIN |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.