The complexity of depth-3 circuits computing symmetric Boolean functions

Guy Wolfovitz. The complexity of depth-3 circuits computing symmetric Boolean functions. Inf. Process. Lett., 100(2):41-46, 2006. [doi]

Abstract

Abstract is missing.