Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR06-049 | 9th April 2006 00:00

The Complexity of Depth-3 Circuits Computing Symmetric Boolean Functions

TR06-049
Authors: Guy Wolfovitz
Publication: 18th April 2006 15:39