1. L.M.Adleman. The circuit complexity of the threshold 2 function. Unpublished manuscript, Dept. of Mathematics, M.I.T. (1979).
2. P.A.Bloniarz. The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph. (Ph.D. thesis.) Technical Report No. 238, Laboratory for Computer Science, M.I.T. (1979).
3. P.E.Dunne. A 2.5n lower bound on the monotone network complexity of T
3
n
. Theory of Computation Report No. 62, University of Warwick (1984).
4. P.E. Dunne. Lower bounds on the monotone network complexity of threshold functions. Unpublished manuscript, Dept. of Computer Science, University of Warwick (1984).
5. M.J. Fischer, A.R. Meyer and M.S. Paterson. Ω(n log n) lower bounds on the length of Boolean formulas. SIAM J. Comput. 11 (1982), 416–427.