View Single Post
Old 2007-12-15, 19:59   #7
vector's Avatar
Nov 2007

110012 Posts

I wrote it because I thought it would result in faster multiplication than the bigInteger multiplication method. It is supposed to break the large multiplication problem into many small multiplication problems which I though would take less time to complete than the one large multiplication. There are use for this though. You can use this multiplication instead of the fft to slow down the execution of many factoring programs. Just for fun of course. On theoretical grounds this is the only multiplication algorithm I know which is both faster than exponential and slower than O(n^2) trial multiplication.
vector is offline   Reply With Quote