Sib. Èlektron. Mat. Izv., 2019, Volume 16, Pages 523–541
Discrete mathematics and mathematical cybernetics
Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
A. S. Frantseva
Irkutsk State University, 1, Karl Marx str., Irkutsk, 664003, Russia
In this paper, we study the problem of receiving the complexity's value of Boolean functions' representations in some classes of polynomial normal forms or exclusive-or sum-of-products expressions (ESOPs). These classes are extensions of known classes of polarized Zhegalkin polynomials or Reed-Muller forms and the Kronecker forms' class. An operator approach for the ESOPs classes' description is used in the work. A Boolean function is represented as a sum of operator images with respect to some basis function. If we consider the product's function as the basic function, then the classes of operator forms are becoming the ESOPs. In this paper, we received estimates of the complexity's value in various classes of extended pair-generated operator forms. The lower bound of the complexity's value to the class of all extended pair-generated operator forms (A. Baliuk and S. Vinokourov, 2001) was improved.
Boolean functions, polynomial normal forms, exclusive-or sum-of-products expressions, extended pair-generated operator forms.
PDF file (205 kB)
Received July 26, 2019, published April 19, 2019
A. S. Frantseva, “Complexity of Boolean functions' representations in classes of extended pair-generated operator forms”, Sib. Èlektron. Mat. Izv., 16 (2019), 523–541
Citation in format AMSBIB
\paper Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
\jour Sib. \`Elektron. Mat. Izv.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|