A faster algorithm for testing polynomial representability of functions over finite integer rings
From MaRDI portal
Publication:2344759
DOI10.1016/j.tcs.2015.02.013zbMath1400.68263arXiv1402.5789OpenAlexW2011248826MaRDI QIDQ2344759
Ambedkar Dukkipati, Ashwin Guha
Publication date: 18 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5789
Related Items (2)
Polynomial functions over finite commutative rings ⋮ Polynomial functions on rings of dual numbers over residue class rings of the integers
Cites Work
- Polynomial functions (mod m)
- Functions and polynomials over Galois rings
- On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
- On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\)
- On polynomial functions (mod m)
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- Counting polynomial functions \(\pmod{p^ n}\)
- Functions and polynomials ($mod p^n$)
- Unnamed Item
- Unnamed Item
This page was built for publication: A faster algorithm for testing polynomial representability of functions over finite integer rings