Skip to main content
SpringerLink
Log in

Fast multiplication of long numbers using FFT

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. Schonhage and V. Strassen, “Fast multiplication of long numbers,” [Russian translation], Kibern. Sb., No. 2, 87–98 (1973).

    Google Scholar 

  2. D. Knuth, The Art of Computer Programming [Russian translation], Vol. 2, Mir, Moscow (1973).

    Google Scholar 

  3. V. K. Zadiraka, Theory of Evaluation of the Fourier Transform [in Russian], Naukova Dumka, Kiev (1983).

    Google Scholar 

  4. A. A. Karatsuba and Yu. P. Ofman, “Multiplication of multi-digit numbers by automata,” Dokl. Akad. Nauk SSSR,145, 293–294 (1962).

    Google Scholar 

  5. S. A. Cooke and S. O. Anderaa, “Minimum function evaluation time” [Russian translation], Kibern. Sb., No. 8, 191–214 (1971).

    Google Scholar 

Download references

Authors
  1. V. K. Zadiraka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. S. Mel'nikova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 63–67, May–June, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zadiraka, V.K., Mel'nikova, S.S. Fast multiplication of long numbers using FFT. Cybern Syst Anal 32, 360–363 (1996). https://doi.org/10.1007/BF02366498

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02366498

Keywords

Search

Navigation