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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Frontiers of Computer Science Jg. 20; H. 1; S. 2001405
Hauptverfasser:	Allender, Eric, Williams, Ryan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Beijing Higher Education Press 01.01.2026 Springer Nature B.V
Schlagworte:	Computer Science Correspondence computational complexity theory
ISSN:	2095-2228, 2095-2236
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!