Talk:Karatsuba algorithm: Difference between revisions

Revision as of 10:22, 10 February 2013

Revision as of 12:52, 13 February 2013

Line 70:

== Further subdivision 1:4 ==

ladies.... if the operands are 1:4 length they might be a particular form of 4:4 n then we might find better orders for "Karatsuba algo (1960") <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 20:54, 25 May 2012 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

:Yes, that is true (if I understand your idea correctly) and is called [[Toom-Cook multiplication]].--[[User:LutzL|LutzL]] ([[User talk:LutzL|talk]]) 12:45, 7 December 2012 (UTC)

i guess this ideas stands evn its for pure creative reasons only, thank u for let it posted <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 15:11, 2 February 2013 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

well, its a bit problematic, but still, i think there is a chance to look 4 optimization by... allocating the preferable conditions in two directions : optimizing the plan on a level of the plan/plans d&c, n allocating the preferable conditions both to make it working in more than one level not only one that takes all the advantage of 1:4 condition

i think it could b a chance to b a problem oriented on programmer analysts problematic :-) [[Special:Contributions/93.118.212.93|93.118.212.93]] ([[User talk:93.118.212.93|talk]]) 12:52, 13 February 2013 (UTC)

== Possible linear long integer multiplyings algo ==