1. A. Chin, Shallow circuits for the counting functions, Tech. Rept. PRG-8-90, Computing Laboratory, University of Oxford, Oxford.
2. Ω(n log n) lower bounds on length of Boolean formulas;Fischer;SIAM J. Comput.,1982
3. Parity, circuits and the polynomial-time hierarchy;Furst;Proc. 22nd Annual IEEE Symposium on Foundations of Computer Science,1981
4. Almost optimal lower bounds for small depth circuits;Håstad;Proc. 18th Annual ACM Symposium on Theory of Computing,1986
5. Monotone circuits of connectivity require super-logarithmic depth;Karchmer;Proc. 20th Annual ACM Symposium on Theory of Computing,1988