Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
NP-hard SAT and CSP problems which admit exponentially improved algorithms
(
acm.org
)
5 points
by
cevi
on Dec 24, 2021
|
hide
|
past
|
favorite
|
1 comment
cevi
on Dec 24, 2021
[–]
The arxiv version isn't very different from the published version, if you end up facing a paywall:
https://arxiv.org/pdf/1801.09488.pdf
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
