| ▲ | krackers 2 hours ago | |
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] | ||
| ▲ | baq an hour ago | parent | next [-] | |
What a time to be alive honestly. Can’t know what one will wake up to | ||
| ▲ | adverbly 43 minutes ago | parent | prev [-] | |
> superpolynomial I've got some reading to do it seems... | ||