Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
K. L. Rychkov · Journal of Applied and Industrial Mathematics · 2018
Using Khrapchenko’s method, we obtain the exact lower bound of 40 for the complexity in the class of π -schemes of a linear Boolean function depending substantially on 6 variables. We give a simplified proof of several lower bounds for the complexity of linear Boolean functions which are previously obtained on the basis of the same method.