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...
Saved in:
| Published in: | Frontiers of Computer Science Vol. 20; no. 1; p. 2001405 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Beijing
Higher Education Press
01.01.2026
Springer Nature B.V |
| Subjects: | |
| ISSN: | 2095-2228, 2095-2236 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!