反馈文件质量
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
英语 [en] · 中文 [zh] · AZW3 · 2.3MB · 2014 · 📘 非小说类图书 · 🚀/duxiu/lgli/upload/zlib · Save
描述
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.
备用文件名
upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/图书馆8号/综合书库②/书籍漫画/百科全书+漫画合集/百科全书/kindle/05-特别整理/分卷2/extracted__分卷2.part01.rar/kindle人全网资源/kindle人精品资源区51-60/P060核对完/可能与不可能的边界.azw3
备用文件名
upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/Kindle电子书库（012）/综合书籍（007）/综合1（011）/书1/Kindle人论坛精品书籍打包/extracted__P060核对完.zip/P060核对完/可能与不可能的边界.azw3
备用文件名
upload/duxiu_main2/【星空藏书馆】/【星空藏书馆】等多个文件/图书馆7号/【05】kindle人社区网站备份/P060核对完/可能与不可能的边界.azw3
备用文件名
upload/duxiu_main/v/zip/extracted__./P060核对完.zip/可能与不可能的边界.azw3
备用文件名
lgli/Lance Fortnow - 可能与不可能的边界：P/NP问题趣史 (2014, 人民邮电出版社).azw3
备用文件名
zlib/no-category/Lance Fortnow/可能与不可能的边界：P/NP问题趣史_16313538.azw3
备选作者
福特诺 (Fortnow, Lance)
备选作者
(美)福特诺著;杨帆译
备用出版商
The People's Posts and Telecommunications Publishing House
备用出版商
Princeton University, Department of Art & Archaeology
备用出版商
Princeton University Press
备用版本
BusinessPro collection, Princeton, N.J, ©2013
备用版本
Princeton University Press, Princeton, 2013
备用版本
United States, United States of America
备用版本
China, People's Republic, China
备用版本
First Edition, 1, PS, 2013
备用版本
Bei jing, 2014
元数据中的注释
sources:
calibre:6593dfad-7ae7-4333-ba76-4e55172e0915
元数据中的注释
Bookmarks: p1 (p1): 第1章 金券
p1-1 (p3): 1.1 划分的难题
p1-2 (p4): 1.2 手
p1-3 (p5): 1.3 PNP问题
p1-4 (p6): 1.4 找到金券
p1-5 (p7): 1.5 漫漫长途
p1-6 (p8): 1.6 划分难题的解
p2 (p10): 第2章 美妙的世界
p2-1 (p10): 2.1 厄巴纳算法
p2-2 (p13): 2.2 计算机1，癌症0
p2-3 (p14): 2.3 棒球比赛
p2-4 (p17): 2.4 奥卡姆剃刀
p2-5 (p21): 2.5 创造力的自动化
p2-6 (p22): 2.6 终极侦探
p2-7 (p23): 2.7 美妙世界的阴暗面
p2-8 (p24): 2.8 回到现实
p3 (p25): 第3章 P和NP
p3-1 (p25): 3.1 敌友国
p3-2 (p25): 3.2 六度理论
p3-3 (p28): 3.3 牵线搭桥
p3-4 (p31): 3.4 团问题
p3-5 (p32): 3.5 “递棍儿”
p3-6 (p36): 3.6 刷房子
p3-7 (p38): 3.7 分组
p3-8 (p39): 3.8 P和NP
p3-9 (p40): 3.9 敌友国之外
p3-10 (p43): 3.1 0 Icosian游戏的一个解
p4 (p44): 第4章 NP中最难的问题
p4-1 (p44): 4.1 第一个NP完全问题
p4-2 (p47): 4.2 21个问题
p4-3 (p49): 4.3 起个好名字有那么重要吗
p4-4 (p51): 4.4 超越卡普的工作
p4-5 (p57): 4.5 漏网之鱼
p5 (p62): 第5章 P和NP诞生前的历史
p5-1 (p63): 5.1 西方
p5-2 (p68): 5.2 东方
p5-3 (p74): 5.3 哥德尔的信
p5-4 (p74): 5.4 火星人法则
p6 (p76): 第6章 处理困难的问题
p6-1 (p77): 6.1 蛮力
p6-2 (p78): 6.2 启发式方法
p6-3 (p83): 6.3 搜索小规模的解
p6-4 (p85): 6.4 近似计算方法
p6-5 (p90): 6.5 解决一个不同的问题
p6-6 (p92): 6.6 接受现实
p6-7 (p92): 6.7 总结
p7 (p94): 第7章 证明P≠NP
p7-1 (p95): 7.1 骗子悖论
p7-2 (p97): 7.2 电路
p7-3 (p102): 7.3 证明P≠NP时常犯的错误
p7-4 (p104): 7.4 现状
p8 (p106): 第8章 秘密
p8-1 (p106): 8.1 经典密码学简史
p8-2 (p108): 8.2 现代密码学
p8-3 (p111): 8.3 P=NP下的密码学
p8-4 (p112): 8.4 零知识数独
p8-5 (p117): 8.5 玩游戏
p8-6 (p119): 8.6 在云上进行加密计算
p8-7 (p120): 8.7 创造随机性
p8-8 (p121): 8.8 持续的挑战
p9 (p123): 第9章 量子
p9-1 (p123): 9.1 量子录像机
p9-2 (p127): 9.2 量子密码学
p9-3 (p128): 9.3 量子隐形传输
p9-4 (p132): 9.4 量子的未来
p10 (p133): 第10章 未来
p10-1 (p133): 10.1 并行计算
p10-2 (p135): 10.2 处理大数据
p10-3 (p136): 10.3 一切事物的网络化
p10-4 (p137): 10.4 应对科技变革
p10-5 (p138): 10.5 关于P/NP问题的结束语
p11 (p140): 章节注释和文献
p12 (p147): 人名表
备用描述
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.
备用描述
"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
备用描述
"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"-- Résumé de l'éditeur
备用描述
本书首先追溯了P/NP问题是如何产生的;然后给出了这个问题的许多实例, 涉及经济学, 物理学和生物学在内的多个学科;接下来探讨了涵盖P/NP难题中所有难度等级的问题, 从寻找游玩迪士尼乐园所有景点的最短路线, 到地图填色等
开源日期
2021-06-15
更多信息……

🚀 快速下载

成为会员以支持书籍、论文等的长期保存。为了感谢您对我们的支持，您将获得高速下载权益。❤️
如果您在本月捐款，您将获得双倍的快速下载次数。

🐢 低速下载

由可信的合作方提供。 更多信息请参见常见问题解答。 （可能需要验证浏览器——无限次下载！）

所有选项下载的文件都相同，应该可以安全使用。即使这样，从互联网下载文件时始终要小心。例如，确保您的设备更新及时。
显示外部下载
  • 对于大文件，我们建议使用下载管理器以防止中断。
    推荐的下载管理器：JDownloader
  • 您将需要一个电子书或 PDF 阅读器来打开文件，具体取决于文件格式。
    推荐的电子书阅读器：Anna的档案在线查看器、ReadEra和Calibre
  • 使用在线工具进行格式转换。
    推荐的转换工具：CloudConvert和PrintFriendly
  • 您可以将 PDF 和 EPUB 文件发送到您的 Kindle 或 Kobo 电子阅读器。
    推荐的工具：亚马逊的“发送到 Kindle”和djazz 的“发送到 Kobo/Kindle”
  • 支持作者和图书馆
    ✍️ 如果您喜欢这个并且能够负担得起，请考虑购买原版，或直接支持作者。
    📚 如果您当地的图书馆有这本书，请考虑在那里免费借阅。