The Complexity of Computing
The power of negative thinking in multiplying Boolean matrices
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
2.25 N-Lower Bound on the Combinational Complexity of Boolean Functions
2.25 N-Lower Bound on the Combinational Complexity of Boolean Functions
Complexity of Monotone Networks for Boolean Matrix Product
Complexity of Monotone Networks for Boolean Matrix Product
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Tight bounds for the multiplicative complexity of symmetric functions
Theoretical Computer Science
Concrete multiplicative complexity of symmetric functions
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Consider the combinational complexity L(f) of Boolean functions over the basis &Ohgr; &equil; {f¦ f:{0,1}2 → {0,1}}. A new Method for proving linear lower bounds of size 2n is presented. Combining it with methods presented in [12] and [15], we establish for a special sequence of functions fn:{0,1}n → {0,1}: 2.5n ≤ L(f) &le 6n. Also a trade-off result between circuit complexity and formula size is derived.