A faster algorithm for testing polynomial representability of functions over finite integer rings (Q2344759)

scientific article

Language	Label	Description	Also known as
English	A faster algorithm for testing polynomial representability of functions over finite integer rings	scientific article

Statements

instance of

scholarly article

0 references

title

A faster algorithm for testing polynomial representability of functions over finite integer rings (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

18 May 2015

0 references

full work available at URL

https://arxiv.org/abs/1402.5789

0 references

zbMATH Keywords

polynomial functions

0 references

finite integer rings

0 references

Kempner function

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Functions and polynomials over Galois rings

0 references

Functions and polynomials ($mod p^n$)

0 references

On polynomial functions from $\mathbb{Z}_ n$ to $\mathbb{Z}_ m$

0 references

On polynomial functions from $\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}$ to $\mathbb{Z}_ m$

0 references

An algorithmic characterization of polynomial functions over $\mathbb Z_{p^n}$

0 references

Q3415009

0 references

Counting polynomial functions $\pmod{p^ n}$

0 references

Q4655256

0 references

Polynomial functions (mod m)

0 references

On polynomial functions (mod m)

0 references

Identifiers

zbMATH Open document ID

1400.68263

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.TCS.2015.02.013

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2344759