Talk:Long multiplication: Difference between revisions
Content added Content deleted
(→Wrong algorithms: new section) |
(→Wrong algorithms: Append to my previous comment.) |
||
| Line 60: | Line 60: | ||
For these examples, I would like some assurance that the outside algorithm really is long multiplication, and not some other algorithm (such as Karatsuba or Toom multiplication). Examples that use the wrong algorithm are incorrect. Further, I would like to clarify the task, to prohibit the use of outside algorithms, unless those algorithms do long multiplication. I think that [[Arbitrary-precision integers (included)]] is a better place to call outside algorithms. --[[User:Kernigh|Kernigh]] 00:36, 20 March 2012 (UTC) |
For these examples, I would like some assurance that the outside algorithm really is long multiplication, and not some other algorithm (such as Karatsuba or Toom multiplication). Examples that use the wrong algorithm are incorrect. Further, I would like to clarify the task, to prohibit the use of outside algorithms, unless those algorithms do long multiplication. I think that [[Arbitrary-precision integers (included)]] is a better place to call outside algorithms. --[[User:Kernigh|Kernigh]] 00:36, 20 March 2012 (UTC) |
||
At the moment, I believe that <math>2^{64}</math> and <math>2^{128}</math> are so small that most outside algorithms would use long multiplication. (In [[MRI]] Ruby, the threshold for Karatsuba multiplication seems to be around <math>2^{2240}</math> or <math>2^{4480}</math>.) --[[User:Kernigh|Kernigh]] 03:03, 20 March 2012 (UTC) |
|||