A Faster Algorithm For Testing Polynomial Representability Of Functions Over Finite Integer Rings
Rings and Algebras
2015-02-16 v3
Abstract
Given a function from to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over by constructing a generating set for the -module of polynomial functions. This characterization results in an algorithm that is faster on average in deciding polynomial representability. We also extend the characterization to functions in several variables.
Cite
@article{arxiv.1402.5789,
title = {A Faster Algorithm For Testing Polynomial Representability Of Functions Over Finite Integer Rings},
author = {Ashwin Guha and Ambedkar Dukkipati},
journal= {arXiv preprint arXiv:1402.5789},
year = {2015}
}