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

Full description

Saved in:

Bibliographic Details
Published in:	Frontiers of Computer Science Vol. 20; no. 1; p. 2001405
Main Authors:	Allender, Eric, Williams, Ryan
Format:	Journal Article
Language:	English
Published:	Beijing Higher Education Press 01.01.2026 Springer Nature B.V
Subjects:	Computer Science Correspondence computational complexity theory
ISSN:	2095-2228, 2095-2236
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	SourceType-Scholarly Journals-1 ObjectType-Correspondence-1 content type line 14
ISSN:	2095-2228 2095-2236
DOI:	10.1007/s11704-025-53000-5