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

DOI10.1515/DMA-2014-0013MaRDI QIDQ892606zbMATH OpenOpenAlexFDO

Authors Anton V. Bukhman

Publication date 11 November 2015

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2014-0013

zbMATH Keywords

Boolean functionsperiodicity detectionpolynomial-time algorithms

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials
• Periodic Boolean functions and a lower bound for the complexity of operators
• Complexity of Boolean functions in a class of canonical polarized polynomials
• Complexity of Boolean functions in the class of canonical polarized polynomials
• Complexity of Boolean functions in the class of polarized polynomial forms
• On complexity of searching for periods of functions given by polynomials over a prime field
• Some properties of polynomial-like Boolean functions
• Computational bound on complexity of polynomial representations of Boolean functions
• Polynomial transformation of Boolean functions: analysis of computational algorithms
• On periodic properties of polylinear shift registers

Cited in

(3)

• Finding periods of Zhegalkin polynomials
• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials
• On complexity of searching for periods of functions given by polynomials over a prime field

This page was built for publication: Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892606)