Comment Comment by krackers https://github.com/openai/math/tree/main/preprints/The-Expon...>We give a deterministic algorithm for exactly counting the satisfying assignments of an arbitrary k-CNF formula [in superpolynomial but subexponential time] parent krackers 4 days ago
>We give a deterministic algorithm for exactly counting the satisfying assignments of an arbitrary k-CNF formula [in superpolynomial but subexponential time]