The #ETH is False, #k-SAT is in Sub-Exponential Time

Abstract

We orchestrate a randomized algorithm for #$k$-SAT which counts the exact number of satisfying assignments in $2^{o(n)}$ time. The existence of such algorithm signifies that the #ETH is hereby refuted, and so are $\oplus$ETH, ETH, #SETH, $\oplus$SETH and SETH.

arXiv comment12 pages, 1 figure

References in corpus (2)

• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• The Long, the Short and the Random