On complexity of searching for periods of functions given by polynomials over a prime field
From MaRDI portal
Publication:5878613
Recommendations
- Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- A fast algorithm for determining the minimal polynomial of \(up^n\)-periodic sequence
- Counting Value Sets: Algorithm and Complexity
- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1076147 (Why is no real title available?)
- A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions
- Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
- Certain problems associated with Boolean polynomials
- On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Testing the shift-equivalence of polynomials using quantum machines
This page was built for publication: On complexity of searching for periods of functions given by polynomials over a prime field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878613)
