14699 search results - page 226 / 2940 » Complexity and Cognitive Computing |
ASAP
2003
IEEE
15 years 9 months ago
2003
IEEE
76
Voted
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
145
click to vote
FOCS
1991
IEEE
15 years 7 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...
IBMRD
2011
14 years 10 months ago
2011
129
click to vote
FCT
2009
Springer
15 years 10 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...