983 search results - page 1 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
CIE
2010
Springer
13 years 9 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
IPL
2010
13 years 3 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
ECCC
2006
13 years 4 months ago
2006
