A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
On the possibility of faster SAT algorithms
[chapter]
2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems. We show that attaining any of the following bounds would improve the state of the art in algorithms for SAT: • an O(n k−ε ) algorithm for k-Dominating Set, for any k ≥ 3, • a (computationally efficient) protocol for 3-party set disjointness with o(m) bits of communication, • an n o(d) algorithm for d-SUM, • an O(n 2−ε ) algorithm for 2-SAT with m =
doi:10.1137/1.9781611973075.86
dblp:conf/soda/PatrascuW10
fatcat:lomltgvirfahxo34h25wbqatkq