Wolfgang J. Paul. A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, 5-7 May 1975, Albuquerque, New Mexico, USA. pages 27-36, ACM, 1975.
@inproceedings{Paul75:0,
title = {A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions},
author = {Wolfgang J. Paul},
year = {1975},
researchr = {https://researchr.org/publication/Paul75%3A0},
cites = {0},
citedby = {0},
pages = {27-36},
booktitle = {Conference Record of Seventh Annual ACM Symposium on Theory of Computation, 5-7 May 1975, Albuquerque, New Mexico, USA},
publisher = {ACM},
}