An Algorithmic Characterization Of Polynomial Functions Over Zpn
The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can be represented as a polynomial. In this thesis we consider polynomial representability over a special class of finite rings, namely, Zpn, wh...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://etd.iisc.ernet.in/handle/2005/2337 http://etd.ncsi.iisc.ernet.in/abstracts/3004/G25316-Abs.pdf |