Clever Geek Handbook
📜 ⬆️ ⬇️

Fast multiplication

Fast multiplication is a common name for several fast algorithms for multiplying large numbers. Rapid multiplication methods have led to the development of a separate field of computer science, dealing with fast algorithms.

History

Method list

  • The Karatsuba method is historically the first method.
  • Tooma-Cook multiplication is a modified Karatsuba method.
  • Schönhage-Strassen multiplication method

See also

  • The Strassen fast matrix multiplication method is a generalization of the Karatsuba method to matrices.
  • The Trachtenberg method is a convenient arithmetic multiplication method.
  • The algorithm of Bournickel - Ziegler is a fast division algorithm.


The source is https://ru.wikipedia.org/w/index.php?title=Quick_&oldid=83796147


More articles:

  • Mikun
  • Sallavan, Margaret
  • Kirpichnikov, Alexander Ivanovich
  • HMAS Sydney (1944)
  • Rudinstein, Mark G.
  • TightVNC
  • Baton, Rene Emmanuel
  • Football at the 1912 Summer Olympics
  • Model of the upper atmosphere of the Earth
  • Pokrovsky Monastery (Kharkov)

All articles

Clever Geek | 2019