Lower bounds to the complexity of symmetric Boolean functions

Abstract

We prove Ω(n log n) (Ω(n log n(log log n) 1), respectively) lower bounds on the complexity of an explicity defined symmetric Boolean function and for the majority of symmetric Boolean functions for branching programs of bounded (unbounded, respectively) widths. © 1990.