Post

Ragnar {Groot Koerkamp}
@curiouscoding.nl

Skimming this new PDF, I feel some similarities to the sub-n*lg(n) FFT writeup by David Harvey. It's all like breaking the n^3 matmul bound: instead of doing many independent mat-vec-mul units of work, do them all at once, exploiting structure to save a few operations. bsky.app/profile/curi...

Ryan Williams@rrwilliams.bsky.social

Here's a direct link to the PDF claiming a faster 3SAT algorithm: github.com/openai/math/...

github.commath/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/paper.pdf at main · openai/mathContribute to openai/math development by creating an account on GitHub.

2 reposts2 likes

No replies yet.