NP-hard SAT and CSP problems which admit exponentially improved algorithms (dl.acm.org) 5 points by cevi 4y ago ↗ HN
[–] cevi 4y ago ↗ 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
1 comment
[ 5.5 ms ] story [ 10.7 ms ] thread