43 search results - page 3 / 9 » The Complexity of Depth-3 Circuits Computing Symmetric Boole... |
ICCD
2003
IEEE
14 years 3 months ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
FOCS
1991
IEEE
13 years 9 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...
FOCS
2007
IEEE
13 years 10 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...
STOC
1996
ACM
13 years 10 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
CF
2008
ACM
13 years 8 months ago
2008
ACM
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...