TE
TechEcho
Home
24h Top
Newest
Best
Ask
Show
Jobs
English
GitHub
Twitter
Home
NP-hard SAT and CSP problems which admit exponentially improved algorithms
5 points
by
cevi
over 3 years ago
1 comment
cevi
over 3 years ago
The arxiv version isn't very different from the published version, if you end up facing a paywall: <a href="https://arxiv.org/pdf/1801.09488.pdf" rel="nofollow">https://arxiv.org/pdf/1801.09488.pdf</a>