Revision as of 11:27, 9 February 2013 edit 93.118.212.93 (talk) →Possible linear algorithm simple n efficient just like K idea ← Previous edit		Revision as of 19:09, 9 February 2013 edit undo LutzL (talk \| contribs) Extended confirmed users 1,187 edits →Possible linear algorithm simple n efficient just like K idea Next edit →
Line 114: Anyway, this idea was meant 4 binary computations and if its not working, we might use partial operands mixing such as from 2 operands of N/2 length forming the result of 3N/4 length , n keep trying gaining "autosolve" results in order to obtain for example T(N)=7T(N/4) master method formulas which is not linear, i agree :) [[Special:Contributions/93.118.212.93\|93.118.212.93]] ([[User talk:93.118.212.93\|talk]]) 09:19, 9 February 2013 (UTC) :This is the general Toom-Cook idea. Please read and understand the paper by Bernstein, as I told You before.--[[User:LutzL\|LutzL]] ([[User talk:LutzL\|talk]]) 19:09, 9 February 2013 (UTC)

Talk:Karatsuba algorithm: Difference between revisions