【24h】

Tutorial: Current state of P vs NP problem

机译:教程:P与NP问题的当前状态

获取原文

摘要

Do I understand the problem of P vs. NP? The answer is a simple "no". If I were to understand the problem, I would''ve solved it as well" — This is the current state of many theoretical computer scientists around the world. Apart from a bag of laureates waiting for the person who successfully understands this most popular millennium prize riddle, this is also considered to be a game changer in both mathematics and computer science. According to Scott Aaronson, "If P = NP, then the world would be a profoundly different place than we usually assume it to be". The speaker intends to share the part that he understood on the problem, and about the efforts that were recently put-forth in cracking the same.
机译:我了解P与NP的问题吗?答案是简单的“否”。如果我要理解这个问题,我也会“也解决它” —这是世界上许多理论计算机科学家的当前状态。谜语之谜,这在数学和计算机科学方面也被认为是改变游戏规则的人。根据Scott Aaronson的说法,“如果P = NP,那么世界将与我们通常认为的世界大不相同。”打算分享他对问题的理解以及最近为解决该问题所做的努力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号