On complexity of searching for periods of functions given by polynomials over a prime field (Q5878613)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On complexity of searching for periods of functions given by polynomials over a prime field |
scientific article; zbMATH DE number 7656020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of searching for periods of functions given by polynomials over a prime field |
scientific article; zbMATH DE number 7656020 |
Statements
On complexity of searching for periods of functions given by polynomials over a prime field (English)
0 references
21 February 2023
0 references
\(p\)-valued function (function of \(p\)-valued logic)
0 references
finite field
0 references
prime field
0 references
polynomial over field
0 references
periodicity
0 references
algorithm
0 references
complexity
0 references
0 references
0 references
0.8154362440109253
0 references
0.791102945804596
0 references
0.7803476452827454
0 references
0.7427542805671692
0 references
