Finding periods of Zhegalkin polynomials

DOI10.1515/dma-2022-0012OpenAlexW4285504302MaRDI QIDQ2088723

Svetlana N. Selezneva

Publication date: 6 October 2022

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

Full work available at URL: https://doi.org/10.1515/dma-2022-0012

zbMATH Keywords

complexityperiodicityBoolean functionZhegalkin polynomiallinear structure

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial
• On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
• On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
• Polynomials With Linear Structure and Maiorana–McFarland Construction
• Certain problems associated with Boolean polynomials

This page was built for publication: Finding periods of Zhegalkin polynomials