A relation between additive and multiplicative complexity of Boolean functions
arXiv:1303.4177
Abstract
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {+,*,1}.
4 pages, in English; 4 pages, in Russian