Name
Abstract | ||
|---|---|---|
We prove a necessary and sufficient condition for a function being a polynomial function over a finite, commutative, unital ring. Further, we give an algorithm running in quasilinear time that determines whether or not a function given by its function table can be represented by a polynomial, and if the answer is yes then it provides one such polynomial. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.09.002 | Theoretical Computer Science |
Keywords | Field | DocType |
Polynomial functions,Local rings,Interpolation | Alternating polynomial,Discrete mathematics,Combinatorics,Stable polynomial,Polynomial,Polynomial ring,Monic polynomial,Homogeneous polynomial,Reciprocal polynomial,Matrix polynomial,Mathematics | Journal |
Volume | Issue | ISSN |
703 | C | 0304-3975 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Bulyovszky | 1 | 0 | 0.34 |
| Gábor Horváth | 2 | 210 | 35.47 |