Talk:Fast algorithms

So what?

This article is defining a notion of a fast algorithm for evaluating a function on large numbers (i.e. numbers for which we need to care about bit complexity instead of the more usual RAM model) by relating the complexity of the function evaluation algorithm to the complexity of matrix multiplication by a $log^{c}(n)$ factor.

But why is this definition important? There's no deep result claimed here like saying for instance that you cannot do better than that for an arbitrary function. Is this a conjecture article? Pcap ping 23:42, 20 August 2009 (UTC)[reply]

Wrong info on matrix multiplication?

It appears to contradict Coppersmith–Winograd algorithm, i.e. the complexity cannot be below O(n²), unless I'm missing something... Pcap ping 23:58, 20 August 2009 (UTC)[reply]