Ryan Williams @rrwilliams.bsky.social
@rrwilliams
Professor @MITEECS and @MIT_CSAIL. Complexity, algorithms, and related math. I'll let you know when P != NP (and when it's not)
505 Following 15.5K Followers
Here's a direct link to OpenAI's PDF claiming a refutation of ETH. In particular, it's claimed that 3SAT on n variables is in about exp(n/(log n)^{1/2+o(1)}) time
An internal model at OpenAI has produced a claimed refutation of ETH! Russell Impagliazzo, Mohan Paturi, and I have been asked to help organize an open and independent examination of this claim. 1/4
Funny, I've been calling it the mathslopcalypse. To each their own.
Can anyone honestly say they found a paper among the hundreds in the release that's *not* a huge pain to read (without AI assistance)?
Show more
