A relation between additive and multiplicative complexity of Boolean functions
Data Structures and Algorithms
2013-03-19 v1
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}.
Keywords
Cite
@article{arxiv.1303.4177,
title = {A relation between additive and multiplicative complexity of Boolean functions},
author = {Igor S. Sergeev},
journal= {arXiv preprint arXiv:1303.4177},
year = {2013}
}
Comments
4 pages, in English; 4 pages, in Russian