On complexity of searching for periods of functions given by polynomials over a prime field

DOI10.33048/DAIO.2022.29.727zbMATH Open1505.11149OpenAlexW4221071296WikidataQ114037243 ScholiaQ114037243MaRDI QIDQ5878613FDOQ5878613

Authors: Svetlana N. Selezneva 

Publication date: 21 February 2023

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da1293

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

zbMATH Keywords

algorithmcomplexityfinite fieldperiodicityprime fieldpolynomial over field\(p\)-valued function (function of \(p\)-valued logic)

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Many-valued logic (03B50) Polynomials over finite fields (11T06)

Cites Work

• Title not available (Why is that?)
• Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
• On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
• Certain problems associated with Boolean polynomials
• Title not available (Why is that?)
• Testing the shift-equivalence of polynomials using quantum machines
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
• 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

Cited In (1)

• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial

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)