Re:Decades-Old Computer Science Conjecture Solved in Two Pages
by tathougies on Friday July 26, 2019 @02:14AM
(#20532764)
I think the most interesting point of the paper isn't simply the proof the conjecture but also the sqrt(n) bound. I doubt many downstream results were predicated on that particular bound.
[ Parent
| on HN ]
Re:Decades-Old Computer Science Conjecture Solved in Two Pages
by carlmr on Friday July 26, 2019 @05:11AM
(#20533427)
>Huang’s result is even stronger than necessary to prove the sensitivity conjecture, and this power should yield new insights about complexity measures.
If I interpret this correctly it's a tighter bound than the original conjecture, so it should allow better optimizations.