3 ms·
I don't think the article was bad enough to call it "fluff". Also the result is technically "guaranteed to be faster than the *currently best known* methods of
by Moodles 6y ago
I don't think the article was bad enough to call it "fluff". Also the result is technically "guaranteed to be faster than the *currently best known* methods of solving dense linear systems", no? It might be the case that there's still some better way involving matrices that's faster than this iterative guessing method. Or did they prove that none could possibly exist?
- oscardssmith 6y agoThey proved that any dense algorithm of n^w where w>2 can be made more efficient. Note that 2 is a trivial lower bound for w.