1. N.Alon and R.B.Boppana: The monotone circuit complexity of Boolean functions, manuscript (1985)— to appear in Combinatorica.
2. A.E. Andreev: On one method of obtaining lower bounds of individual monotone function complexity, Dokl. Akad. Nauk SSSR, 282 (1985), pp. 1033–1037.
3. P.E. Dunne: Lower bounds on the complexity of 1-time-only branching programs, Lecture Notes in Comput. Sci.,199(1985), pp.90–99.
4. M.Furst, J.B.Saxe and M.Sipser: Parity, circuits and polynomial-time hierarchy, 22ND Symp. on the Foundations of Computer Science, (1981), pp. 260–270.
5. S.V. Jablonskij: On algorithmic obstacles in synthesis of minimal contact schemes, Problemy Kibernetiki, 2 (1959), pp.75–121.