New w/ Meghal Gupta, William He, @BooleanAnalysisarxiv.org/abs/2508.09422
We give a quadratically faster classical algo for noisy planted kXOR (k > large const), dispelling (for now) claimed quartic speedup for quantum algos. 🧵 (1/10)
Breakthrough by Fei-Minzer-Wang on what seemed a very, very hard problem!
w/ Saxena-Sudan-@Santho_Velusamy, we gave logspace O(1)-pass algorithms to (1/2-ε)-approximate Max-Directed-Cut.
FMW result implies: (1/2+ε)-approximation needs poly(n) passes.
arxiv.org/abs/2503.23404
I made a Youtube version of my SODA 2025 talk on streaming algorithms for Max-Directed-Cut towards the 1/2 threshold, via local algorithms! w/ Raghuvansh Saxena, Madhu Sudan, @Santho_Velusamy, recorded from New Orleans ❤️