Wolfgang J. Paul
A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions
STOC, 1975.
@inproceedings{STOC-1975-Paul,
author = "Wolfgang J. Paul",
booktitle = "{Proceedings of the Seventh Annual ACM Symposium on Theory of Computing}",
doi = "10.1145/800116.803750",
pages = "27--36",
publisher = "{ACM}",
title = "{A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions}",
year = 1975,
}











