Joan Boyar, René Peralta, Denis Pochuev. On the multiplicative complexity of Boolean functions over the basis (cap, +, 1). Theoretical Computer Science, 235(1):43-57, 2000. [doi]
@article{BoyarPP00,
title = {On the multiplicative complexity of Boolean functions over the basis (cap, +, 1)},
author = {Joan Boyar and René Peralta and Denis Pochuev},
year = {2000},
doi = {10.1016/S0304-3975(99)00182-6},
url = {http://dx.doi.org/10.1016/S0304-3975(99)00182-6},
researchr = {https://researchr.org/publication/BoyarPP00},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {235},
number = {1},
pages = {43-57},
}