Content deleted Content added
Line 132:
However, it doesn't explains the algorithm for compute that. Is there the time for applying long multiplication, or just apply Karatsuba algorithm again to that expression? [[Special:Contributions/31.42.239.14|31.42.239.14]] ([[User talk:31.42.239.14|talk]]) 21:54, 25 February 2013 (UTC)
== ok, abt some a bit different K idea possible able 4 generalization ==
multiplying A=(a1;a2) with B=(b1;b2) might be planned like this (a1+b1)*(a2+b2), (a1-b1)*(a2-b2), and a1*b1... i think this could challenge Toom-Cook algo, by some K. generalization that use mostly algebraic sums n possibly finding more simplier systems of equation... the algebraic sums to b multiplied that ofer decent agebraig sums of desired coetients might b search evn automatically, by the computer...good luck! (i posted similary tries on Toom - Cook talk page.) [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 10:51, 27 March 2013 (UTC)
| |||