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

02/03/2021

∙

by   Giorgio Camerani, et al.

∙

0

∙

share

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 ⊕ETH, ETH, #SETH, ⊕SETH and SETH.