3 ms·
They 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.
by oscardssmith 6y ago
They 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.