75 search results - page 2 / 15 » On the Monotone Circuit Complexity of Quadratic Boolean Func... |
103
Voted
FCT
2009
Springer
15 years 7 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...
95
Voted
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
It is widely suspected that Erdos-R
ECCC
2006
15 years 1 months ago
2006
93
Voted
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
112
Voted
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...