mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Math (https://www.mersenneforum.org/forumdisplay.php?f=8)
-   -   Schönhage-Strassen Algorithm Paper (https://www.mersenneforum.org/showthread.php?t=11906)

flouran 2009-05-23 03:48

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

CRGreathouse 2009-05-23 05:05

I don't know that a translation has ever been published at all.

flouran 2009-05-23 05:08

[QUOTE=CRGreathouse;174551]I don't know that a translation has ever been published at all.[/QUOTE]
Then do you know of any English discourses about it you could possibly refer me to?

flouran 2009-05-23 06:09

Actually, does anyone have this paper?:

Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251–280, 1990.

jasonp 2009-05-23 11:07

[QUOTE=flouran;174547]
Or a fairly modern English discourse of the algorithm (other than Knuth vol. 2)?
[/QUOTE]
The last reference on [url="http://en.wikipedia.org/wiki/Sch%C3%B6nhage-Strassen_algorithm"]the wikipedia page[/url] is very good.

flouran 2009-05-23 18:17

[QUOTE=jasonp;174562]The last reference on [url="http://en.wikipedia.org/wiki/Sch%C3%B6nhage-Strassen_algorithm"]the wikipedia page[/url] is very good.[/QUOTE]
Thanks! That worked.

Andi_HB 2009-05-23 20:08

You can also take a look to this Paper [URL="http://www.cse.psu.edu/%7Efurer/Papers/mult.pdf"]http://www.cse.psu.edu/~furer/Papers/mult.pdf[/URL]

Regards Andi_HB

flouran 2009-05-23 20:12

[QUOTE=Andi_HB;174603]You can also take a look to this Paper [URL="http://www.cse.psu.edu/%7Efurer/Papers/mult.pdf"]http://www.cse.psu.edu/~furer/Papers/mult.pdf[/URL]

Regards Andi_HB[/QUOTE]

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.

CRGreathouse 2009-05-23 23:52

[QUOTE=flouran;174554]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]

[QUOTE=flouran;174606]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.[/QUOTE]

I see you have a sense of humor.


All times are UTC. The time now is 10:48.

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