RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika

Diskr. Mat., 2000, Volume 12, Issue 3, Pages 124–153 (Mi dm340)

Remarks on the fast multiplication of polynomials, and Fourier and Hartley transforms
S. B. Gashkov

This publication is cited in the following articles:
  1. S. B. Gashkov, I. S. Sergeev, “Umnozhenie”, Chebyshevskii sb., 21:1 (2020), 101–134  mathnet  crossref
  2. Gashkov S. Frolov A. Sergeev I., “Arithmetic in Finite Fields Supporting Type-2 Or Type-3 Optimal Normal Bases”, Dependability Engineering and Complex Systems, Advances in Intelligent Systems and Computing, 470, ed. Zamojski W. Mazurkiewicz J. Sugier J. Walkowiak T. Kacprzyk J., Springer Int Publishing Ag, 2016, 157–168  crossref  isi  scopus
  3. S. B. Gashkov, I. S. Sergeev, “Complexity of computation in finite fields”, J. Math. Sci., 191:5 (2013), 661–685  mathnet  crossref
  4. Burtsev A.A., Gashkov S.B., “O skhemakh dlya arifmetiki v konechnykh polyakh”, Trudy moskovskogo fiziko-tekhnicheskogo instituta, 2012, 15–22  elib
  5. Gashkov S.B., Gashkov I.B., “Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields”, Fundamenta Informaticae, 104:3 (2010), 227–238  mathscinet  zmath  isi  elib


© Steklov Math. Inst. of RAS, 2026