Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits

[1]  Pavel Pudlák.  The hierarchy of Boolean circuits , 1987 .

[2]  J. Spencer.  Ramsey Theory , 1990 .

[3]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  Alexander A. Razborov,et al.  On the method of approximations , 1989, STOC '89.

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

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

[7]  Vojtech Rödl,et al.  Lower Bounds to the Complexity of Symmetric Boolean Functions , 1990, Theor. Comput. Sci..

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

[9]  Allan Borodin,et al.  Bounds for width two branching programs , 1983, SIAM J. Comput..