A high-performance algorithm for calculating conjunctive and disjunctive terms in polynomial representations of Boolean functions

The computer calculation of values of Boolean functions and systems of Boolean functions represented by normal polynomial forms starts from calculating values of terms of this polynomial followed by operations performed over the results. For the classical calculation method, this process is sequential. In this work, an algorithm is given that uses no more than one logical operation and one comparison to calculate the values of disjunctive and conjunctive terms of polynomial forms.