Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435949 | Theoretical Computer Science | 2015 | 12 Pages |
Abstract
Given a function from ZnZn to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over ZnZn by constructing a generating set for the ZnZn-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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ashwin Guha, Ambedkar Dukkipati,