Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretnaya Matematika, 2011, Volume 23, Issue 3, Pages 3–22
DOI: https://doi.org/10.4213/dm1149
(Mi dm1149)
 

This article is cited in 7 scientific papers (total in 7 papers)

A fast algorithm for the construction of polynomials modulo $k$ for $k$-valued functions for composite $k$

S. N. Selezneva
Full-text PDF (192 kB) Citations (7)
References:
Received: 16.02.2011
English version:
Discrete Mathematics and Applications, 2011, Volume 21, Issue 5-6, Pages 651–674
DOI: https://doi.org/10.1515/dma.2011.039
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: S. N. Selezneva, “A fast algorithm for the construction of polynomials modulo $k$ for $k$-valued functions for composite $k$”, Diskr. Mat., 23:3 (2011), 3–22; Discrete Math. Appl., 21:5-6 (2011), 651–674
Citation in format AMSBIB
\Bibitem{Sel11}
\by S.~N.~Selezneva
\paper A fast algorithm for the construction of polynomials modulo~$k$ for $k$-valued functions for composite~$k$
\jour Diskr. Mat.
\yr 2011
\vol 23
\issue 3
\pages 3--22
\mathnet{http://mi.mathnet.ru/dm1149}
\crossref{https://doi.org/10.4213/dm1149}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2895511}
\elib{https://elibrary.ru/item.asp?id=20730392}
\transl
\jour Discrete Math. Appl.
\yr 2011
\vol 21
\issue 5-6
\pages 651--674
\crossref{https://doi.org/10.1515/dma.2011.039}
Linking options:
  • https://www.mathnet.ru/eng/dm1149
  • https://doi.org/10.4213/dm1149
  • https://www.mathnet.ru/eng/dm/v23/i3/p3
  • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:651
    Full-text PDF :343
    References:69
    First page:29
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024