Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Dokl. Akad. Nauk SSSR, 1962, Volume 145, Number 2, Pages 293–294 (Mi dan26729)  

This article is cited in 16 scientific papers (total in 17 papers)

CYBERNETICS AND THE REGULATION THEORY

Multiplication of many-digital numbers by automatic computers

A. Karatsuba, Yu. Ofman


Full text: PDF file (261 kB)
Presented: А. Н. Колмогоров
Received: 09.02.1962

Citation: A. Karatsuba, Yu. Ofman, “Multiplication of many-digital numbers by automatic computers”, Dokl. Akad. Nauk SSSR, 145:2 (1962), 293–294

Citation in format AMSBIB
\Bibitem{KarOfm62}
\by A.~Karatsuba, Yu.~Ofman
\paper Multiplication of many-digital numbers by automatic computers
\jour Dokl. Akad. Nauk SSSR
\yr 1962
\vol 145
\issue 2
\pages 293--294
\mathnet{http://mi.mathnet.ru/dan26729}


Linking options:
  • http://mi.mathnet.ru/eng/dan26729
  • http://mi.mathnet.ru/eng/dan/v145/i2/p293

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. A. Karatsuba, “On a new method for fast evaluation of transcendental functions”, Russian Math. Surveys, 46:2 (1991), 246–247  mathnet  crossref  mathscinet  zmath  adsnasa  isi
    2. I. D. Kan, B. S. Stechkin, I. V. Sharkov, “Frobenius problem for three arguments”, Math. Notes, 62:4 (1997), 521–523  mathnet  crossref  crossref  mathscinet  zmath  isi
    3. E. A. Karatsuba, “Fast Evaluation of the Hurwitz Zeta Function and Dirichlet $L$-Series”, Problems Inform. Transmission, 34:4 (1998), 342–353  mathnet  mathscinet  zmath
    4. S. B. Gashkov, “Remarks on the fast multiplication of polynomials, and Fourier and Hartley transforms”, Discrete Math. Appl., 10:5 (2000), 499–528  mathnet  crossref  mathscinet  zmath
    5. S. B. Gashkov, I. S. Sergeev, “On design of circuits of logarithmic depth for inversion in finite fields”, Discrete Math. Appl., 18:5 (2008), 483–504  mathnet  crossref  crossref  mathscinet  zmath  elib
    6. S. B. Gashkov, A. A. Bolotov, A. A. Burtsev, S. Yu. Zhebet, A. B. Frolov, “On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings”, J. Math. Sci., 168:1 (2010), 49–75  mathnet  crossref  mathscinet
    7. I. S. Sergeev, “Fast algorithms for elementary operations on complex power series”, Discrete Math. Appl., 20:1 (2010), 25–60  mathnet  crossref  crossref  mathscinet  zmath  elib
    8. D. Yu. Bugaichenko, I. P. Solovev, “Predstavlenie diskretnykh sluchainykh velichin s primeneniem mnogokornevykh diagramm reshenii”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 2012, no. 2, 66–74  mathnet
    9. A. D. Korshunov, “Computational complexity of Boolean functions”, Russian Math. Surveys, 67:1 (2012), 93–165  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    10. S. A. Gritsenko, E. A. Karatsuba, M. A. Korolev, I. S. Rezvyakova, D. I. Tolev, M. E. Changa, “Scientific Achievements of Anatolii Alekseevich Karatsuba”, Proc. Steklov Inst. Math., 280, suppl. 2 (2013), S1–S22  mathnet  crossref  crossref  zmath  isi  elib
    11. S. B. Gashkov, I. S. Sergeev, “Complexity of computation in finite fields”, J. Math. Sci., 191:5 (2013), 661–685  mathnet  crossref
    12. E. A. Karatsuba, “Fast Catalan constant computation via the approximations obtained by the Kummer's type transformations”, Discrete Math. Appl., 23:5-6 (2013), 429–443  mathnet  crossref  crossref  mathscinet  elib
    13. S. V. Yakhontov, “Effektivnoe po vremeni i pamyati vychislenie logarifmicheskoi funktsii veschestvennogo argumenta na mashine Shenkhage”, PDM, 2013, no. 2(20), 101–114  mathnet
    14. V. B. Alekseev, A. V. Smirnov, “On the Exact and Approximate Bilinear Complexities of Multiplication of $4\times2$ and $2\times2$ Matrices”, Proc. Steklov Inst. Math., 282, suppl. 1 (2013), S123–S139  mathnet  crossref  crossref  isi  elib
    15. E. A. Karatsuba, “O vychislenii funktsii Besselya putem summirovaniya ryadov”, Sib. zhurn. vychisl. matem., 22:4 (2019), 453–472  mathnet  crossref
    16. S. B. Gashkov, I. S. Sergeev, “Umnozhenie”, Chebyshevskii sb., 21:1 (2020), 101–134  mathnet  crossref
    17. A. A. Aleksashkina, A. N. Kostromin, Yu. V. Nesterenko, “O bystrom algoritme vychisleniya preobrazovaniya Fure”, Vestn. Mosk. un-ta. Ser. 1. Matem., mekh., 2021, no. 3, 36–41  mathnet
  • Number of views:
    This page:1712
    Full text:900

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021