A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions

A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions Wolfgang J. Paul 27-36 conf/stoc/STOC7 1975 STOC db/conf/stoc/stoc75.html#Paul75