Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time

DOI10.1007/978-3-642-30642-6_28zbMath1360.68956OpenAlexW2218787566MaRDI QIDQ2907510

Svetlana N. Selezneva

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Related Items (2)

On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\) ⋮ Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates

This page was built for publication: Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time