Checking the polynomiality of single-variable functions of k-valued logic composite modulo k

DOI10.3103/S0278641924700067MaRDI QIDQ6572946FDOQ6572946

Authors: Svetlana N. Selezneva 

Publication date: 16 July 2024

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithmcomplexitypolynomial functionfunction of \(k\)-valued logicpolynomial modulo \(k\)

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11Txx) General logic (03Bxx) Polynomials and matrices (11Cxx)

Cites Work

• Title not available (Why is that?)
• On polynomial functions (mod m)
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
• A fast algorithm for the construction of polynomials modulo \(k\) for \(k\)-valued functions for composite \(k\)
• Functions and polynomials ($mod p^n$)
• A method for constructing polynomials of k-valued logic functions
• Superstructure of the closed class of polynomials modulo k
• On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\)

This page was built for publication: Checking the polynomiality of single-variable functions of \({k}\)-valued logic composite modulo \({k}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572946)