Sebastien Bubeck
@SebastienBubeck
I work on AI at OpenAI. Former VP AI and Distinguished Scientist at Microsoft.
加入 January 2012
1.5K 正在關注 93.7K 粉絲
3SAT in subexponential time (2^{n / log^eps(n)}) is maybe the biggest surprise I have seen during my 20 years following theoretical computer science (still remember the feeling 25 years ago seeing the diff a 3 versus a 2 can make for complexity 😅)
顯示更多
