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

Giorgio Camerani

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.

Knowledge Graph



Sign up or login to leave a comment