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

Gespeichert in:
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!
Abstract 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.
AbstractList 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.
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.
ArticleNumber 2001405
Author Allender, Eric
Williams, Ryan
Author_xml – sequence: 1
  givenname: Eric
  surname: Allender
  fullname: Allender, Eric
  email: allender@cs.rutgers.edu
  organization: Rutgers University
– sequence: 2
  givenname: Ryan
  surname: Williams
  fullname: Williams, Ryan
  organization: Massachusetts Institute of Technology
BookMark eNp9kE1OwzAQhS1UJErpBVhFYm06HteJs6wq_qRKLChrK07HtBVNWjtBsOtB4HI9CYYg2LGZmcX33tO8U9ar6ooYOxdwKQCyURAigzEHVFxJAODqiPURcsURZdr7vVGfsGEI64hghBVin42m9WZDVZPUVXLYvz9M5omnXbvyFBJ6XRZtaFYvlAQqfLk87D_O2LErngMNf_aAPV5fzae3fHZ_czedzHgpRdrwmLvQmcuhzFFrW1pMXU5K5bLUFq2wkqwCVSjrbJYtXBSBtmObO0q1XBRywC46362vdy2Fxqzr1lcx0khUAtOx1iJS2FGlr0Pw5MzWrzaFfzMCzFc3puvGxHfNdzdxDpjsRCHC1RP5P-t_VJ-DXWjF
Cites_doi 10.1016/j.tcs.2005.09.023
10.1007/s11704-025-50231-4
ContentType Journal Article
Copyright Higher Education Press 2026
Higher Education Press 2026.
Copyright_xml – notice: Higher Education Press 2026
– notice: Higher Education Press 2026.
DBID AAYXX
CITATION
JQ2
DOI 10.1007/s11704-025-53000-5
DatabaseName CrossRef
ProQuest Computer Science Collection
DatabaseTitle CrossRef
ProQuest Computer Science Collection
DatabaseTitleList ProQuest Computer Science Collection
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2095-2236
ExternalDocumentID 10_1007_s11704_025_53000_5
Genre Correspondence
GroupedDBID -SI
-S~
.VR
06D
0R~
0VY
1-T
2J2
2JN
2JY
2KG
2KM
2LR
30V
4.4
406
408
40E
5VS
95-
95.
96X
AABHQ
AACDK
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARTL
AASML
AATLR
AATNV
AATVU
AAUYE
AAWCG
AAXDM
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBRH
ABDBE
ABDZT
ABECU
ABFSG
ABFTD
ABFTV
ABHQN
ABJNI
ABJOX
ABKCH
ABMQK
ABNWP
ABQBU
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABWNU
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACPIV
ACSNA
ACSTC
ACZOJ
ADHIR
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEFQL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFHIU
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHBYD
AHKAY
AHPBZ
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AOCGG
ARMRJ
ATHPR
AXYYD
AYFIA
B-.
BGNMA
BSONS
CAJEI
CSCUP
DDRTE
DNIVK
DPUIP
EBLON
EBS
EIOEI
ESBYG
FERAY
FFXSO
FIGPU
FNLPD
FRRFC
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
HF~
HMJXF
HRMNR
HZ~
IKXTQ
IWAJR
IXD
I~Z
J-C
JBSCW
JZLTJ
KOV
LLZTM
M4Y
MA-
NPVJJ
NQJWS
NU0
O9J
P4S
PF0
PT4
R89
ROL
RSV
S16
S3B
SAP
SCL
SCO
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
TSG
TUC
U1G
U5S
UG4
UOJIU
UTJUX
UZXMN
VFIZW
W48
YLTOR
ZMTXR
AARHV
AAYXX
ACBXY
AEBTG
AEKMD
AFFHD
AFKRA
AFLOW
AGJBK
AHSBF
AJBLW
ARAPS
BDATZ
BENPR
BGLVJ
CCPQU
CITATION
EJD
FINBP
FSGXE
H13
HCIFZ
K7-
PHGZM
PHGZT
PQGLB
Q--
JQ2
ID FETCH-LOGICAL-c316t-236d87f90c9288bcb26f9e5593c8b2b1b3eb505a5bfb77df31608b4b9fe683da3
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001573745900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2095-2228
IngestDate Fri Nov 07 23:38:29 EST 2025
Sat Nov 29 07:29:50 EST 2025
Wed Sep 17 01:15:05 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords computational complexity theory
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c316t-236d87f90c9288bcb26f9e5593c8b2b1b3eb505a5bfb77df31608b4b9fe683da3
Notes SourceType-Scholarly Journals-1
ObjectType-Correspondence-1
content type line 14
OpenAccessLink http://dx.doi.org/10.1007/s11704-025-53000-5
PQID 3251264881
PQPubID 2044369
ParticipantIDs proquest_journals_3251264881
crossref_primary_10_1007_s11704_025_53000_5
springer_journals_10_1007_s11704_025_53000_5
PublicationCentury 2000
PublicationDate 2026-01-01
PublicationDateYYYYMMDD 2026-01-01
PublicationDate_xml – month: 01
  year: 2026
  text: 2026-01-01
  day: 01
PublicationDecade 2020
PublicationPlace Beijing
PublicationPlace_xml – name: Beijing
– name: Heidelberg
PublicationTitle Frontiers of Computer Science
PublicationTitleAbbrev Front. Comput. Sci
PublicationYear 2026
Publisher Higher Education Press
Springer Nature B.V
Publisher_xml – name: Higher Education Press
– name: Springer Nature B.V
References R Williams (53000_CR2) 2005; 348
K Xu (53000_CR1) 2025; 19
References_xml – volume: 348
  start-page: 357
  issue: 2–3
  year: 2005
  ident: 53000_CR2
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2005.09.023
– volume: 19
  start-page: 1912405
  issue: 12
  year: 2025
  ident: 53000_CR1
  publication-title: Frontiers of Computer Science
  doi: 10.1007/s11704-025-50231-4
SSID ssj0002025522
Score 2.3594167
Snippet 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...
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...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 2001405
SubjectTerms Computer Science
Correspondence
Title Comment on “SAT requires exhaustive search”
URI https://link.springer.com/article/10.1007/s11704-025-53000-5
https://www.proquest.com/docview/3251264881
Volume 20
WOSCitedRecordID wos001573745900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLink Journals
  customDbUrl:
  eissn: 2095-2236
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002025522
  issn: 2095-2228
  databaseCode: RSV
  dateStart: 20070201
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV29TsMwED5BYWCh_IpCQR7YwKKx68QZK0TFgCqkFtTNyjm2YElRUxBjHwRerk-CnSZEIBhgTmJFn-7nuzvfHcBp6qIqRwQktZhY2k3QUnRemIpAh1raJDWmGJl_Ew0GcjyOb8umsLy67V6VJAtLXTe7BZG_McEEFdz3Q4tVWBN-2oyP0Yf3n5kV5mlyUT5gjj9Qn-Iou2V-PuarR6pp5rfKaOFw-s3__eoWbJYEk_SWErENKybbgWa1vIGUurwLF741xHkcMsnIYv427I3I1PhrwSYn5vXBjwNyhpAsNWExf9-Du_7V6PKaltsTqOZBOKOMh6mMbNzRMZMSNbLQxsYFEFxLZBggN-joTyLQYhSl1n3UkdjF2JpQ8jTh-9DIJpk5ABJGHDuJ7nIUjg0wI6PUxUF-RYdMYmZYC84qBNXTckiGqscheyyUw0IVWCjRgnYFsioVJlfc86zQWZOgBecVqPXj3087_NvrR7Dh5KNMorShMZs-m2NY1y-zx3x6UgjSBxgLweI
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1PS8MwFH_oFPTi_IvTqTl40-CatE16HOJQnEPYlN1CkybopZN1isd9EP1y-yQmXWtR9KDntqH8yHvv9_4DHCfWq7JEgGMjY4P9WBosrRXGgadCxU2caJ2PzO-yXo8Ph9Ft0RSWldXuZUoy19RVs5vHXMUECXBAXT90sAhLvluz43z0_v1nZIU4mpynD4jlD9iFOIpumZ-P-WqRKpr5LTOaG5xO_X-_ug5rBcFE7fmN2IAFnW5CvVzegApZ3oIz1xpiLQ4apWg2feu3B2isXVmwzpB-fXDjgKwiRHNJmE3ft-GuczE4v8TF9gSsqBdOMKFhwpmJWioinEslSWgibR0Iqrgk0pNUS0t_4kAayVhi7EctLn0ZGR1ymsR0B2rpKNW7gEJGZStWPpWBZQNEc5ZYP8it6OBxRDRpwEmJoHiaD8kQ1Thkh4WwWIgcCxE0oFmCLAqByQR1PCu02sRrwGkJavX499P2_vb6EaxcDm66onvVu96HVXtXioBKE2qT8bM-gGX1MnnMxof5pfoAOVnExg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB1BQYgLZRWFAj5wA6uNncU5VkAFoqoqWhA3K3ZswSWt2oA49kPg5_ol2FkoIDggzklG0dOM581qgOPYRFWGCDCsRaSxGwmNhfHC2HOkL5mOYqWylfmdoNtl9_dh79MUf9btXpYk85kGu6UpSRujWDfmg29OYLsniIc9amejvUVYck0kY5u6bvp3H1kWYilzVkoghktgm-4oJmd-FvPVO80p57cqaeZ82tX___Y6rBXEE7VyTdmABZVsQrW81AEVNr4FDTsyYkSiYYJm09d-a4DGyrYLqwlSLw92TZA5IFFuIbPp2zbcti8GZ5e4uFUBS-r4KSbUj1mgw6YMCWNCCuLrUJnAgkomiHAEVcLQosgTWgRBrM1HTSZcEWrlMxpHdAcqyTBRu4D8gIpmJF0qPMMSiGJBbOIje3UHi0KiSA1OSjT5KF-ewedrki0W3GDBMyy4V4N6CTgvDGnCqeVfvjllnBqclgDPH_8ube9vrx_BSu-8zTtX3et9WDVqU-RZ6lBJx0_qAJblc_o4GR9m-vUO04TNqg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Comment+on+%E2%80%9CSAT+requires+exhaustive+search%E2%80%9D&rft.jtitle=Frontiers+of+Computer+Science&rft.au=Allender%2C+Eric&rft.au=Williams%2C+Ryan&rft.date=2026-01-01&rft.pub=Springer+Nature+B.V&rft.issn=2095-2228&rft.eissn=2095-2236&rft.volume=20&rft.issue=1&rft.spage=2001405&rft_id=info:doi/10.1007%2Fs11704-025-53000-5&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2095-2228&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2095-2228&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2095-2228&client=summon