可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible - 搜索

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

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

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

zlib/no-category/Lance Fortnow/可能与不可能的边界：P/NP问题趣史_26486057.epub

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

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

中文 [zh] · EPUB · 1.9MB · 2014 · 📗 未知类型的图书 · 🚀/duxiu/zlib · Save

zlib/no-category/Lance Fortnow/可能与不可能的边界：P/NP问题趣史_117499972.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难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

中文 [zh] · MOBI · 2.3MB · 2014 · 📗 未知类型的图书 · 🚀/duxiu/zlib · Save

lgli/Lance Fortnow & chenjin5.com [Fortnow, Lance & chenjin5.com] - 可能与不可能的边界：P/NP问题趣史 (2014, chenjin5.com 海量电子书免费下载).epub

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible Lance Fortnow & chenjin5.com [Fortnow, Lance & chenjin5.com] chenjin5.com 海量电子书免费下载, Di 1 ban, Beijing, 2014

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

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

duxiu/initial_release/可能与不可能的边界_P_NP问题趣史_P, NP, and the search for the impossible_13432796.zip

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

1 (p1): 第1章金券3 (p1-1): 1.1 划分的难题4 (p1-2): 1.2 手5 (p1-3): 1.3 PNP问题6 (p1-4): 1.4 找到金券7 (p1-5): 1.5 漫漫长途8 (p1-6): 1.6 划分难题的解10 (p2): 第2章美妙的世界10 (p2-1): 2.1 厄巴纳算法13 (p2-2): 2.2 计算机1,癌症014 (p2-3): 2.3 棒球比赛17 (p2-4): 2.4 奥卡姆剃刀21 (p2-5): 2.5 创造力的自动化22 (p2-6): 2.6 终极侦探23 (p2-7): 2.7 美妙世界的阴暗面24 (p2-8): 2.8 回到现实25 (p3): 第3章 P和NP25 (p3-1): 3.1 敌友国25 (p3-2): 3.2 六度理论28 (p3-3): 3.3 牵线搭桥31 (p3-4): 3.4 团问题32 (p3-5): 3.5 “递棍儿”36 (p3-6): 3.6 刷房子38 (p3-7): 3.7 分组39 (p3-8): 3.8 P和NP40 (p3-9): 3.9 敌友国之外43 (p3-10): 3.1 0 Icosian游戏的一个解44 (p4): 第4章 NP中最难的问题44 (p4-1): 4.1 第一个NP完全问题47 (p4-2): 4.2 21个问题49 (p4-3): 4.3 起个好名字有那么重要吗51 (p4-4): 4.4 超越卡普的工作57 (p4-5): 4.5 漏网之鱼62 (p5): 第5章 P和NP诞生前的历史63 (p5-1): 5.1 西方68 (p5-2): 5.2 东方74 (p5-3): 5.3 哥德尔的信74 (p5-4): 5.4 火星人法则76 (p6): 第6章处理困难的问题77 (p6-1): 6.1 蛮力78 (p6-2): 6.2 启发式方法83 (p6-3): 6.3 搜索小规模的解85 (p6-4): 6.4 近似计算方法90 (p6-5): 6.5 解决一个不同的问题92 (p6-6): 6.6 接受现实92 (p6-7): 6.7 总结94 (p7): 第7章证明P≠NP95 (p7-1): 7.1 骗子悖论97 (p7-2): 7.2 电路102 (p7-3): 7.3 证明P≠NP时常犯的错误104 (p7-4): 7.4 现状106 (p8): 第8章秘密106 (p8-1): 8.1 经典密码学简史108 (p8-2): 8.2 现代密码学111 (p8-3): 8.3 P=NP下的密码学112 (p8-4): 8.4 零知识数独117 (p8-5): 8.5 玩游戏119 (p8-6): 8.6 在云上进行加密计算120 (p8-7): 8.7 创造随机性121 (p8-8): 8.8 持续的挑战123 (p9): 第9章量子123 (p9-1): 9.1 量子录像机127 (p9-2): 9.2 量子密码学128 (p9-3): 9.3 量子隐形传输132 (p9-4): 9.4 量子的未来133 (p10): 第10章未来133 (p10-1): 10.1 并行计算135 (p10-2): 10.2 处理大数据136 (p10-3): 10.3 一切事物的网络化137 (p10-4): 10.4 应对科技变革138 (p10-5): 10.5 关于P/NP问题的结束语140 (p11): 章节注释和文献147 (p12): 人名表本书首先追溯了P/NP问题是如何产生的

中文 [zh] · PDF · 39.4MB · 2014 · 📗 未知类型的图书 · 🚀/duxiu/zlibzh · Save

lgli/Lance Fortnow & chenjin5.com - 可能与不可能的边界：P/NP问题趣史 (2014, chenjin5.com 海量电子书免费下载).azw3

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible Lance Fortnow & chenjin5.com chenjin5.com 海量电子书免费下载, Di 1 ban, Beijing, 2014

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

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

lgli/Lance Fortnow & chenjin5.com - 可能与不可能的边界：P/NP问题趣史 (2014, chenjin5.com 海量电子书免费下载).mobi

可能与不可能的边界 : P/NP问题趣史 = The golden ticket : P, NP, and the search for the impossible Lance Fortnow & chenjin5.com chenjin5.com 海量电子书免费下载, Di 1 ban, Beijing, 2014

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

中文 [zh] · MOBI · 2.2MB · 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

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

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

upload/duxiu_main2/【大学堂图书馆】/【大学堂40T教程】等多个文件/【02】epubee全站/【13】/69/可能与不可能的边界：PNP问题趣史.epub

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

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

中文 [zh] · EPUB · 2.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, 人民邮电出版社).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问题趣史 (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/【星空藏书馆】/【星空藏书馆】等多个文件/图书馆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

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

zlib/no-category/Lance Fortnow/可能与不可能的边界：P/NP问题趣史_27987999.pdf

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

本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等

中文 [zh] · PDF · 1.6MB · 2014 · 📗 未知类型的图书 · 🚀/duxiu/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/[美]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

❌ 这个文件可能有问题。