Polynomial functions over finite commutative rings
From MaRDI portal
Publication:1676365
DOI10.1016/j.tcs.2017.09.002zbMath1395.13026OpenAlexW2752092322MaRDI QIDQ1676365
Balázs Bulyovszky, Gábor Horváth
Publication date: 7 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.002
Polynomials, factorization in commutative rings (13P05) Polynomials and finite commutative rings (13M10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the structure of finite rings. II
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- A faster algorithm for testing polynomial representability of functions over finite integer rings
- On polynomial functions over finite commutative rings
- Asymptotically Fast Triangularization of Matrices over Rings
- Functions and polynomials ($mod p^n$)
- Polynomial Interpolation Over Commutative Rings
This page was built for publication: Polynomial functions over finite commutative rings