Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

92

ECCC
2006

82views more ECCC 2006»

The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions

15 years 2 months ago

The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions

Download cs.haifa.ac.il

Guy Wolfovitz

Real-time Traffic

ECCC 2006 |

claim paper

Related Content

» New upper bounds on the Boolean circuit complexity of symmetric functions

» Powering requires threshold depth 3

» Circuit Complexity and Multiplicative Complexity of Boolean Functions

» On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata

» Limiting Negations in Formulas

» Energy Complexity and Depth of Threshold Circuits

» Communication Complexity Towards Lower Bounds on Circuit Depth

» Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immuni...

» Cosmological lower bound on the circuit complexity of a small problem in logic

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ECCC
Authors	Guy Wolfovitz

Comments (0)