An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
From MaRDI portal
Publication:2258082
DOI10.1007/s00453-013-9799-7zbMath1321.11126arXiv1203.1122OpenAlexW3100477413MaRDI QIDQ2258082
Ambedkar Dukkipati, Ashwin Guha
Publication date: 2 March 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1122
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Polynomial functions over finite commutative rings ⋮ On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption ⋮ A faster algorithm for testing polynomial representability of functions over finite integer rings
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial functions and permutation polynomials over some finite commutative rings
- Polynomial functions (mod m)
- Functions and polynomials over Galois rings
- Counting polynomial functions \(\pmod{p^ n}\)
- Functions and correspondences in a finite field
- Functions and polynomials ($mod p^n$)
This page was built for publication: An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
