3j0hn

4 ms·

1. 1.▲
   by 3j0hn 4y ago

   Oh yeah, great point. Like plugging numbers into the master theorem, if 5x5 could be done in 25 multiplications, say, it would imply multiplication in O(n^2), and even 45 multiplications would give a new asymptotically fast multiplication.
2. 2.▲
   by 3j0hn 4y ago

   This is a little bit apples and oranges, however. An asymptotic bound on the complexity doesn't say a lot about the number of multiplications needed for a fixed value of n=5 say. A lot of those complexity proofs say "for large eno
3. 3.▲
   by 3j0hn 4y ago

   I wouldn't exactly call it a teaser. The formulas they published stand on their own, and putting them out there in the wake of all the press of the AlphaTensor paper, is just a good idea. Of course, these formulas are not super interes