Scholarlink

<p>An article that was recently published in <i>Frontiers of Computer Science</i> claims to prove that P is not equal to NP. In fact, it claims to show that the SAT problem requires at least 2<sup><i>δn</i></sup> time, for any constant <i>δ</i> ∈ (0, 1). We contend that the argument that is presented falls far short of a proof: it makes an assumption about all possible SAT algorithms that is unwarranted.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Comment on “SAT requires exhaustive search”

  • 期刊论文

  • 发表日期：

    2025年9月17日

查看全文
  • Eric Allender,
  • Ryan Williams

摘要

An article that was recently published in Frontiers of Computer Science claims to prove that P is not equal to NP. In fact, it claims to show that the SAT problem requires at least 2δn time, for any constant δ ∈ (0, 1). We contend that the argument that is presented falls far short of a proof: it makes an assumption about all possible SAT algorithms that is unwarranted.