Checking the Polynomiality of Single-Variable Functions of $${k}$$-Valued Logic Composite Modulo $${k}$$
-
Published:2024-06
Issue:2
Volume:48
Page:119-129
-
ISSN:0278-6419
-
Container-title:Moscow University Computational Mathematics and Cybernetics
-
language:en
-
Short-container-title:MoscowUniv.Comput.Math.Cybern.
Reference9 articles.
1. S. V. Yablonskii, ‘‘Functional constructions in a k-valued logic,’’ Trudy Mat. Inst. Steklov 51, 5–142 (1958).
2. L. Carlitz, ‘‘Functions and polynomials $$(\bmod\ p^{n})$$,’’ Acta Arithmetica 9 (1), 67–78 (1964).
3. D. G. Meshchaninov, ‘‘A method for constructing polynomials of $$k$$-valued logic functions,’’ Discrete Math. Appl. 5 (4), 333–346 (1995). https://doi.org/10.1515/dma.1995.5.4.333
4. A. B. Remizov, ‘‘Superstructure of the closed class of polynomials modulo k,’’ Discrete Math. Appl. 1 (1), 9–22 (1991). https://doi.org/10.1515/dma.1991.1.1.9
5. S. N. Selezneva, ‘‘A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k,’’ Discrete Math. Appl. 21 (5–6), 651–674 (2011). https://doi.org/10.1515/dma.2011.039