Complexity of realization of a linear Boolean function in Sheffer’s basis
Yu. A. Kombarov · Moscow University Mathematics Bulletin · 2013
The paper is focused on realization of linear Boolean functions by circuits of functional elements in the basis , which is the Sheffer stroke. The exact value of complexity of negation of linear function is obtained in this paper. Another result is the description of all minimal circuits realizing a linear function.