←
Ryan O'Donnell759 posts
Ryan O'Donnell avatar

Ryan O'Donnell

@BooleanAnalysis

Videos: youtube.com/ryanodonnellteac…

◷ Joined October 2011▧ 239 Photos and videos
Bernardo Subercaseaux 🐒 avatar
⟳ Ryan O'Donnell retweeted
Bernardo Subercaseaux 🐒@b_subercaseaux·Oct 26

Assuming correctness, it seems extremely likely, if not already a direct consequence, that NTIME[t] subseteq DTIME[2^{o(t)}]. It comes down to reducing the auxiliary variables in the CNF encoding of NTIME-acceptance!

Ola Svensson avatar
⟳ Ryan O'Donnell retweeted
Ola Svensson@AlgoSvensson·Oct 15

Happy to share that our better-than-2 approximation results for k-median are now on arXiv: arxiv.org/abs/2610.18144 arxiv.org/abs/2610.17172 It has been a pleasure working with this fantastic group: @rares_buhai , Vincent Cohen-Addad, Henry Fleischmann, @anupamg , Antoni "Toni" Jubés Monforte, Madhusudhan Reddy Pittu, @mstou73, and @LukasBirdyy A special shout-out to Toni, who started working on this problem for his Master's thesis almost two years ago. His work led to the impressive analysis of the factor-revealing LP! Now on to other things...

OpenAI completely solved a problem on which my students have worked hard for 1+ years and made significant progress. They should be proud to have pushed on a problem appearing in this historic list of ~400 results. We’ll soon upload our different algorithmic approach to k-median.

Ryan O'Donnell avatar
Ryan O'Donnell@BooleanAnalysis·Oct 13

I looked forward to this cleanup! Nikloai Chukhin (eccc.weizmann.ac.il/report/2…) significantly cleans and extends the OpenAI 2^(ω(sqrt(n))) lower bound for depth-3 circuits: The (4n-1)-bit function sum_ij a_{i+j}x_iy_j mod 2 needs depth-d circuits of size 2^(Ω~(n log n)^{1/(d-1)}).