"aacid:aacid__worldcat__20250804T000000Z__oK7ZqSgvqYB8h59MDqM8MZ" - 搜索

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 人民邮电出版社).mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · MOBI · 2.7MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/图书三区/分类书库/02.精选书籍/精排版（出版图书+各类小说资源）mobi+epub+pdf/epub格式电子书(15.5GB)/出版图书(epub格式 8.6GB)/extracted__【菜根阁】6科学科技与互联网浪潮.rar/6科学科技与互联网浪潮/可能与不可能的边界：P NP问题趣史.epub

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · EPUB · 1.7MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/upload/zlib · Save

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2013, ).pdf

可能与不可能的边界:P/NP问题趣史 Lance Fortnow Princeton University Press, Princeton University Press, Princeton, 2013

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · PDF · 6.1MB · 2013 · 📘 非小说类图书 · 🚀/lgli/zlib · Save

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 人民邮电出版社).azw3

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · AZW3 · 2.3MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 人民邮电出版社).epub

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · EPUB · 1.9MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 人民邮电出版社).epub

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · EPUB · 1.9MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

lgli/Lance Fortnow & ePUBw.COM - 可能与不可能的边界：P/NP问题趣史 (2014, 人民邮电出版社).azw3

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible Lance Fortnow & ePUBw.COM 北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · AZW3 · 2.3MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/图书五区/分类站点02/kindle原版书籍/整理书籍合集E/0406可能与不可能的边界：P_NP问题趣史-Fortnow, Lance-2019更新.mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · MOBI · 2.3MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/upload/zlib · Save

upload/duxiu_main/x/rar/6科学科技与互联网浪潮/可能与不可能的边界：P NP问题趣史/可能与不可能的边界：P NP问题趣史.pdf

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible Lance Fortnow [Fortnow, Lance] 北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · PDF · 4.6MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/upload/zlib · Save

upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/图书三区/分类书库/02.精选书籍/精排版（出版图书+各类小说资源）mobi+epub+pdf/mobi格式电子书(14.6GB)/出版图书(mobi格式 8.3GB)/extracted__【菜根阁】6科学科技与互联网浪潮.rar/6科学科技与互联网浪潮/可能与不可能的边界：P NP问题趣史.mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

P/NP 问题是计算机科学乃至整个数学领域最重要的开放问题。本书从非技术角度介绍了什么是P/NP 问题、它丰富的历史，以及对于人机交互乃至更多问题的数学意义。在这本趣味十足的书中，作者首先追溯了P/NP 问题是如何产生的，然后给出了这个问题的许多实例，涉及经济学、物理学和生物学在内的多个学科。接下来探讨了涵盖P/NP 难题中所有难度等级的问题，从寻找游玩迪士尼乐园所有景点的最短路线，到地图填色问题，再到找出Facebook 上互为好友的一群人。本书深入探寻了计算能够做到什么、无法做到什么，描绘了尝试解决P/NP问题的益处和其中难以预想的挑战。本书读来引人入胜，适合所有对计算和数学感兴趣的读者。科普,计算机科学,数学,P,Np,计算机,算法,Np问题,数学科普

英语 [en] · 中文 [zh] · MOBI · 2.0MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/upload/zlib · Save

upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/沁园斋图书馆（006）/图书馆（008）/9-中英文日常更新/中英日常更新/2019年（此目录下大部分与镇店之宝和英文原版畅销书书重复）/201904/中文（1-3200）/extracted__azw3（801-1200）.zip/[\xc3\xc0]Lance Fortnow-\xbf\xc9\xc4\xdc\xd3벻\xbf\xc9\xc4ܵı߽磺P_NP\xce\xca\xcc\xe2Ȥʷ.azw3

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · AZW3 · 2.3MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/upload/zlib · Save

upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/图书馆8号/综合书库②/kindle电子书-200万册/图书合集/其他合集/中亚图书汇总（有书单）/extracted__中亚第一部分.zip/\xb5\xdaһ\xb2\xbf\xb7\xd6/[\xbf\xc9\xc4\xdc\xd3벻\xbf\xc9\xc4ܵı߽\xe7-P.NP\xce\xca\xcc\xe2Ȥʷ].The.Golden.Ticket-P.NP.and.the.Search.for.the.Impossible.mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆北京：人民邮电出版社, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

中文 [zh] · MOBI · 10.3MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/lgrs/nexusstc/upload/zlib · Save

lgli/[美]Lance Fortnow - 可能与不可能的边界：PNP问题趣史 (2013, cj5_2532).mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆 cj5_2532, Princeton University Press, Princeton, 2013

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · MOBI · 2.7MB · 2013 · 📕 小说类图书 · 🚀/duxiu/lgli/zlib · Save

❌ 这个文件可能有问题。

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 冥王星出版社_38).mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆冥王星出版社_38, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · MOBI · 2.4MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

❌ 这个文件可能有问题。

lgli/[美]Lance Fortnow - 可能与不可能的边界：PNP问题趣史 (2013, 蓝星出版社_64).mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆蓝星出版社_64, Princeton University Press, Princeton, 2013

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · MOBI · 2.7MB · 2013 · 📕 小说类图书 · 🚀/duxiu/lgli/zlib · Save

❌ 这个文件可能有问题。

lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 冥王星出版社_38).epub

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible (美)Lance Fortnow著 ; 杨帆译; 福特诺; 杨帆冥王星出版社_38, Di 1 ban, Beijing, 2014

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · 中文 [zh] · EPUB · 2.1MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/zlib · Save

❌ 这个文件可能有问题。

lgli/Fortnow, Lance - The Golden Ticket.pdf

The Golden Ticket : P, NP, and the Search for the Impossible Fortnow, Lance Princeton University Press, Princeton University Press, Princeton, 2013

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · PDF · 3.3MB · 2013 · 📘 非小说类图书 · 🚀/lgli/zlib · Save

upload/newsarch_ebooks_2025_10/2022/07/25/The Golden Ticket P, NP, and the Search for the Impossible.pdf

The Golden Ticket : P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 1st, 2013

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.

英语 [en] · PDF · 2.7MB · 2013 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

lgli/K:\!genesis\0day\kolxoz\79\Cs_Computer science\CsPop_Popular-level\Fortnow L. The golden ticket. P, NP, and the search for the impossible (PUP, 2013)(ISBN 9780691156491)(O)(189s)_CsPop_.pdf

The Golden Ticket : P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, First Edition, 1, PS, 2013

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.

英语 [en] · PDF · 2.6MB · 2013 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save

ia/goldenticketpnps0000fort.pdf

The Golden Ticket : P, NP, and the Search for the Impossible Lance Fortnow Princeton: Princeton University Press, Princeton University Press, Princeton, 2013

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · PDF · 7.3MB · 2013 · 📗 未知类型的图书 · 🚀/ia · Save

upload/alexandrina/Collections/Project-Muse/Princeton University Press/The Golden Ticket- P, NP, and the Search for the Impossible.pdf

The Golden Ticket : P, NP, and the Search for the Impossible Fortnow, Lance Princeton University Press, 2018

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · PDF · 6.6MB · 2018 · 📘 非小说类图书 · 🚀/lgli/upload/zlib · Save

nexusstc/The Golden Ticket/b9a974dde63b9e60d6a4cb3900421f61.epub

The Golden Ticket : P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, Princeton University Press, Princeton, 2013

The computer science problem whose solution could transform life as we know it The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

英语 [en] · EPUB · 6.0MB · 2013 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save

nexusstc/The Golden Ticket: P, NP, and the Search for the Impossible/77f4e33fa299e71a90c70999a49be1e3.epub

The Golden Ticket : P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, course book, 2013

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-- 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. Lance Fortnow. Includes Bibliographical References (pages 165-169) And Index.

英语 [en] · EPUB · 1.4MB · 2013 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save

upload/degruyter/DeGruyter Partners/Princeton University Press [RETAIL]/10.1515_9781400846610.pdf

The Golden Ticket : P, NP, and the Search for the Impossible Fortnow, Lance Princeton University Press, Course Book, 2013 dec 31

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-- 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. Lance Fortnow. Includes Bibliographical References (pages 165-169) And Index.

英语 [en] · PDF · 5.1MB · 2013 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save

nexusstc/The Golden Ticket: P, NP, and the Search for the Impossible/363da02905f51961c64ea50b6f162fff.mobi

The Golden Ticket : P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, course book, 2013

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-- 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. Lance Fortnow. Includes Bibliographical References (pages 165-169) And Index.

英语 [en] · MOBI · 1.8MB · 2013 · 📘 非小说类图书 · 🚀/lgli/lgrs/nexusstc/zlib · Save