关于P与NP、几何复杂性理论和黎曼假设
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis
摘要:
几何复杂性理论(GCT)是研究$P$与$NP$及相关问题的一种方法。2009年2月9日至11日,在普林斯顿高等研究院举行的一系列三次讲座中,对这项研究计划和迄今为止取得的成果进行了高层次的概述。这篇文章包含了这些讲座中所涉及的材料,经过一些修改,并给出了GCT的数学概述。没有背景的代数几何,表示论或量子群的假设。
英文摘要:
Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced study, Princeton, Feb 9-11, 2009. This article contains the material covered in those lectures after some revision, and gives a mathematical overview of GCT. No background in algebraic geometry, representation theory or quantum groups is assumed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。