Jump to content

Fürer's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by The Anome (talk | contribs) at 19:23, 5 March 2008 ({{math-stub}} created). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Fürer multiplication is an integer multiplication algorithm for very large numbers with a very low asymptotic complexity.

The Schönhage-Strassen algorithm was the asymptotically fastest multiplication method known from 1971 to 2007. In 2007, Martin Fürer announced a new algorithm with lower asymptotic complexity.[1]

References

  1. ^ Martin Fürer, "Faster integer multiplication", STOC 2007 Proceedings, pp. 57-66.
Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Fürer%27s_algorithm&oldid=196099366"