When Six Gates are Not Enough
Computational Complexity
2016-08-08 v1
Abstract
We apply the pigeonhole principle to show that there must exist Boolean functions on 7 inputs with a multiplicative complexity of at least 7, i.e., that cannot be computed with only 6 multiplications in the Galois field with two elements.
Cite
@article{arxiv.1508.05737,
title = {When Six Gates are Not Enough},
author = {Michael Codish and Luís Cruz-Filipe and Michael Frank and Peter Schneider-Kamp},
journal= {arXiv preprint arXiv:1508.05737},
year = {2016}
}
Comments
IMADA-preprint-cs