7 search results - page 2 / 2 » Lower Bounds for the Complexity of Reliable Boolean Circuits... |
FOCS
2007
IEEE
13 years 9 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
ICCAD
1998
IEEE
13 years 9 months ago
1998
IEEE
Presented in this paper are 1) information-theoretic lower bounds on energy consumption of noisy digital gates and 2) the concept of noise tolerance via coding for achieving energy...