mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2009-05-23, 03:48   #1
flouran
 
flouran's Avatar
 
Dec 2008

72×17 Posts
Thumbs up Schönhage-Strassen Algorithm Paper

Although it is old, does anyone have the English version of:

Schönhage, A. and Strassen, V. "Schnelle Multiplikation Grosser Zahlen." Computing 7, 281-292, 1971.

Or a fairly modern English discourse of the algorithm (other than Knuth vol. 2)?

Thanks,
The Florist
flouran is offline   Reply With Quote
Old 2009-05-23, 05:05   #2
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

I don't know that a translation has ever been published at all.
CRGreathouse is offline   Reply With Quote
Old 2009-05-23, 05:08   #3
flouran
 
flouran's Avatar
 
Dec 2008

11010000012 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
I don't know that a translation has ever been published at all.
Then do you know of any English discourses about it you could possibly refer me to?
flouran is offline   Reply With Quote
Old 2009-05-23, 06:09   #4
flouran
 
flouran's Avatar
 
Dec 2008

72×17 Posts
Default

Actually, does anyone have this paper?:

Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251–280, 1990.
flouran is offline   Reply With Quote
Old 2009-05-23, 11:07   #5
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3×1,181 Posts
Default

Quote:
Originally Posted by flouran View Post
Or a fairly modern English discourse of the algorithm (other than Knuth vol. 2)?
The last reference on the wikipedia page is very good.
jasonp is offline   Reply With Quote
Old 2009-05-23, 18:17   #6
flouran
 
flouran's Avatar
 
Dec 2008

72×17 Posts
Default

Quote:
Originally Posted by jasonp View Post
The last reference on the wikipedia page is very good.
Thanks! That worked.
flouran is offline   Reply With Quote
Old 2009-05-23, 20:08   #7
Andi_HB
 
Andi_HB's Avatar
 
Mar 2007
Germany

23×3×11 Posts
Default

You can also take a look to this Paper http://www.cse.psu.edu/~furer/Papers/mult.pdf

Regards Andi_HB
Andi_HB is offline   Reply With Quote
Old 2009-05-23, 20:12   #8
flouran
 
flouran's Avatar
 
Dec 2008

72×17 Posts
Default

Quote:
Originally Posted by Andi_HB View Post
You can also take a look to this Paper http://www.cse.psu.edu/~furer/Papers/mult.pdf

Regards Andi_HB
I have seen this paper before, but Fuhrer's algorithm is not used (and probably will not be used) for practical purposes as it is only an improvement of S-S for astronomically large integers.
flouran is offline   Reply With Quote
Old 2009-05-23, 23:52   #9
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

135338 Posts
Default

Quote:
Originally Posted by flouran View Post
Actually, does anyone have this paper?:

Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251–280, 1990.
Quote:
Originally Posted by flouran View Post
I have seen this paper before, but Fuhrer's algorithm is not used (and probably will not be used) for practical purposes as it is only an improvement of S-S for astronomically large integers.
I see you have a sense of humor.
CRGreathouse is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
LLT for Fermats : need a paper T.Rex Math 3 2010-01-06 19:47
Augment Schoenhage-Strassen with an FGT? __HRB__ Programming 4 2009-03-02 17:34
I need a Math paper T.Rex Math 5 2007-04-10 12:00
Need a paper! Citrix Math 21 2005-12-18 08:45
Very interesting K8 paper... Xyzzy Hardware 10 2004-11-23 08:24

All times are UTC. The time now is 11:16.


Sat Dec 4 11:16:41 UTC 2021 up 134 days, 5:45, 0 users, load averages: 0.61, 0.91, 0.97

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.