On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\)

DOI10.1515/DMA-2017-0002zbMath1395.05015OpenAlexW2598775831MaRDI QIDQ1675517

Svetlana N. Selezneva

Publication date: 2 November 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0002

zbMATH Keywords

asymptotic behaviourpolynomialpolynomial functionfunction of \(k\)-valued logicnumeric functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polynomials over finite fields (11T06) Many-valued logic (03B50)

Cites Work

• Unnamed Item
• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
• On polynomial functions (mod m)
• Counting polynomial functions \(\pmod{p^ n}\)
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
• A Generalization of Fermat's Theorem
• A method for constructing polynomials of k-valued logic functions
• A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k

This page was built for publication: On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\)