Functions and polynomials (mod p^n)
From MaRDI portal
Publication:5345016
Cited in
(21)- Groups of permutation polynomials
- On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
- Polynomial functions (mod m)
- Checking the polynomiality of single-variable functions of \({k}\)-valued logic composite modulo \({k}\)
- A faster algorithm for testing polynomial representability of functions over finite integer rings
- Polynomial functions in the residue class rings of Dedekind domains
- Polynomial functions and permutation polynomials over some finite commutative rings
- Sylow p-groups of polynomial permutations on the integers mod p^n.
- Permutation polynomials and their differential properties over residue class rings
- Bhargava's early work: the genesis of \(P\)-orderings
- The Gröbner basis of the ideal of vanishing polynomials
- Functions and polynomials over Galois rings
- On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\)
- Polynomial functions over finite commutative rings
- Finite rings with applications.
- On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
- Polynomials inducing the zero function on chain rings
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- The ring of polyfunctions over Z/nZ
- On polynomial functions over finite commutative rings
- A construction of weakly and non-weakly regular bent functions over the ring of integers modulo p^m
This page was built for publication: Functions and polynomials ($mod p^n$)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5345016)
