Schönhage-Strassen Algorithm Paper

[flouran]

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]

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

[flouran]

Originally Posted by CRGreathouse

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]

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]

Originally Posted by flouran

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

The last reference on the wikipedia page is very good.

[flouran]

Originally Posted by jasonp

The last reference on the wikipedia page is very good.

Thanks! That worked.

[Andi_HB]

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

Regards Andi_HB

[flouran]

Originally Posted by Andi_HB

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.

[CRGreathouse]

Originally Posted by flouran

Actually, does anyone have this paper?:

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

Originally Posted by flouran

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.