On the complexity of realization of the linear function by formulas over finite Boolean bases
D. Yu. Cherukhin · Discrete Mathematics and Applications · 2000
Article On the complexity of realization of the linear function by formulas over finite Boolean bases was published on January 1, 2000 in the journal Discrete Mathematics and Applications (volume 10, issue 2).