.png){kind=icon}
返回
Complexity classes as mathematical axioms
.png){kind=icon}
OA
AI
DOI：10.4007/annals.2009.170.995.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Complexity theory, being the metrical version of decision theory, has long been suspected of harboring undecidable statements among its most prominent conjectures. Taking this possibility seriously, we add one such conjecture, P-#P not equal NP, as a new axiom and find that it has an implication in 3-dimensional topology. This is reminiscent of Harvey Friedman's work on finitistic interpretations of large cardinal axioms.
Keyword:
JONES
期刊
IF:
5.3
论文数:
1.4K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容