A faster algorithm for testing polynomial representability of functions over finite integer rings (Q2344759)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6436207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for testing polynomial representability of functions over finite integer rings |
scientific article; zbMATH DE number 6436207 |
Statements
A faster algorithm for testing polynomial representability of functions over finite integer rings (English)
0 references
18 May 2015
0 references
polynomial functions
0 references
finite integer rings
0 references
Kempner function
0 references
0.8996016383171082
0 references
0.8660998940467834
0 references
0.8297275304794312
0 references
0.7961985468864441
0 references
