Abstract:
This paper concerns complexity of polynomial forms (exor-sum-of-products) representing Boolean functions. Complexity is defined as a minimal number of summands in exor-sum-of-products for a given function. A class of Boolean functions being the most complex among Boolean functions having 6 or less arguments is considered. The exact complexity for functions of described class having 7 agruments is obtained.