反馈文件质量
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
英语 [en] · PDF · 6.6MB · 2018 · 📘 非小说类图书 · 🚀/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.
备用文件名
lgli/R:\Project-Muse\md5_rep\4AD79BF77D03C9D9E0384C26AC598A0F.pdf
备用文件名
zlib/Mathematics/Lance Fortnow/The Golden Ticket: P, NP, and the Search for the Impossible_28125536.pdf
备选作者
Project MUSE (https://muse.jhu.edu/)
备选作者
Lance Fortnow
备用出版商
Princeton University, Department of Art & Archaeology
备用出版商
Princeton Electronic
备用版本
BusinessPro collection, Princeton, N.J, ©2013
备用版本
Princeton University Press, Princeton, 2013
备用版本
United States, United States of America
备用版本
First Edition, 1, PS, 2013
备用版本
1st edition, 2013
备用版本
2, 20130327
元数据中的注释
producers:
Muse-DL/1.1.0
备用描述
Cover 1
Title Page, Copyright, Dedication 2
Contents 8
Preface 10
Chapter 1: The Golden Ticket 14
Chapter 2: The Beautiful World 24
Chapter 3: P and NP 42
Chapter 4: The Hardest Problems in NP 64
Chapter 5: The Prehistory of P versus NP 84
Chapter 6: Dealing with Hardness 102
Chapter 7: Proving P ¬ノᅠ NP 122
Chapter 8: Secrets 136
Chapter 9: Quantum 156
Chapter 10: The Future 168
Acknowledgments 176
Notes 178
Index 184
Publisher:Princeton University Press,Published:2013,ISBN:9781400846610,Related ISBN:9780691156491,Language:English,OCLC:828869723
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 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
开源日期
2022-03-08
更多信息……

🚀 快速下载

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

🐢 低速下载

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

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