Revision as of 02:20, 14 June 2023 edit 2806:2f0:93c0:fd4b:e92a:ec7:7ff6:5cf0 (talk) →Karatsuba method is not (comparatively) as fast as the article said ← Previous edit		Revision as of 06:22, 14 June 2023 edit undo EEng (talk \| contribs) Edit filter helpers, Autopatrolled, Extended confirmed users, New page reviewers, Pending changes reviewers, Template editors 99,779 edits →Karatsuba method is not (comparatively) as fast as the article said: r Next edit →
Line 212: Where is the error in my reasoning, if any? [[Special:Contributions/2806:2F0:93C0:FD4B:E92A:EC7:7FF6:5CF0\|2806:2F0:93C0:FD4B:E92A:EC7:7FF6:5CF0]] ([[User talk:2806:2F0:93C0:FD4B:E92A:EC7:7FF6:5CF0\|talk]]) 01:46, 14 June 2023 (UTC) :This is a divide-and-conquer algorithm, so the multiplications in z0 and z1 wouldn't be carried out by the conventional nxn method, but rather by calling Karatsuba recursively for each of z0 and z1. I find the article's example poorly chosen and awkward, so I'm not guaranteeing there's nothing wrong with it; but what you're talking about isn't it. [[User:EEng#s\|<b style="color:red;">E</b>]][[User talk:EEng#s\|<b style="color:blue;">Eng</b>]] 06:22, 14 June 2023 (UTC)

Talk:Karatsuba algorithm: Difference between revisions