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)
加入 April 2008
505 正在關注 15.5K 粉絲
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
