【24h】

Tutorial: Current state of P vs NP problem

机译:教程:P vs 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的问题吗? 答案是一个简单的"没有#0022; 如果我要了解这个问题,我也会解决它" - 这是世界各地许多理论计算机科学家的当前状态。 除了等待成功理解这一最受欢迎的千年奖谜语的人的一袋奖酶之外,这也被认为是数学和计算机科学中的游戏变更机。 根据Scott Aaronson,"如果p= NP,那么世界将是一个比我们通常认为它是&#x0022的深刻不同的地方。 发言者打算分享他理解的问题,以及最近在裂开中阐明的努力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号