English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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.

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