论文信息 - Lower Bounds to the Complexity of Symmetric Boolean Functions

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.

Vojtech Rödl | Endre Szemerédi | Pavel Pudlák | László Babai

[1] Pavel Pudlák. A Lower Bound on Complexity of Branching Programs (Extended Abstract) , 1984, MFCS.

[2] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .

[3] Vojtech Rödl,et al. Two lower bounds for branching programs , 1986, STOC '86.

[4] Michael J. Fischer,et al. Omega(n log n) Lower Bounds on Length of Boolean Formulas , 1982, SIAM J. Comput..

[5] Noga Alon,et al. Meanders, Ramsey theory and lower bounds for branching programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).