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 2o(n) time. The existence of such algorithm signifies that the #ETH is hereby refuted, and so are , ETH, #SETH, and SETH.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.