Abstract
The algorithmic complexity of periodicity detection of Boolean functions given in a polynomial form is investigated. A function is said to be periodic with period ó if it takes the same values on input strings which differ only by inverting the components corresponding to nonzero entries in the bit string ó. Two polynomial-time algorithms for checking whether a given bit string is a period of a given Boolean function are presented. The relationship between the periods of a function and the length of its polynomial is investigated. The problem of finding the periods is explicitly reduced in polynomial time to the problem of solving a system of Boolean equations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
