Comment on “SAT requires exhaustive search”

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 m...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Frontiers of Computer Science Ročník 20; číslo 1; s. 2001405
Hlavní autoři: Allender, Eric, Williams, Ryan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Higher Education Press 01.01.2026
Springer Nature B.V
Témata:
Computer Science
Correspondence
computational complexity theory
ISSN:2095-2228, 2095-2236
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Correspondence-1
content type line 14
ISSN:2095-2228
2095-2236
DOI:10.1007/s11704-025-53000-5