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

DOI10.1515/dma.2011.039zbMath1272.03110OpenAlexW2039787618MaRDI QIDQ4917373

Svetlana N. Selezneva

Publication date: 29 April 2013

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

Full work available at URL: https://doi.org/10.1515/dma.2011.039

zbMATH Keywords

many-valued logic functions

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Many-valued logic (03B50)

Related Items (4)

The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear ⋮ Closed classes of polynomials modulo \(p^2\) ⋮ On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\) ⋮ Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables

This page was built for publication: A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k