alt Hacker Newshttps://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]
Replies
adverbly • yesterday at 11:19 PM
> superpolynomial
I've got some reading to do it seems...
What a time to be alive honestly. Can’t know what one will wake up to