外部精选
软件工程
#开发者实时流Understanding the Exponential Time Hypothesis, and OpenAI's claim it is false
No. The claimed running time, roughly 2n/logn2^{n/\sqrt{\log n}}2n/logn, is still far above any polynomial, and ETH failing says nothing either way about P vs NP. The paper itself notes that its result doesn't imply s…
Hacker News 最新gravity132026/10/27 · 昨天1 分钟阅读
这个来源的 RSS 只提供摘要，下面是原文导语；完整论述请点「打开原文」。
No. The claimed running time, roughly 2n/logn2^{n/\sqrt{\log n}}2n/logn, is still far above any polynomial, and ETH failing says nothing either way about P vs NP. The paper itself notes that its result doesn't imply subexponential algorithms for general NP problems, because the usual translations between problems can blow up the input size.
本条为导读摘要，完整论述请以原文为准。