1. M. Ajtai, Σ1-formulae on finite structures. Ann.of Pure and Appl.logic, 24 (1984), pp. 1–48.
2. N. Alon and R.B. Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, 7, N.1 (1987), pp. 1–22.
3. A.E. Andreev, On one method of obtaining lower bounds of individual monotone function complexity, Doklady Akad. Nauk SSSR, 282 (1985), pp. 1033–1037.
4. A.E. Andreev, On one method of obtaining effective lower bounds of monotone complexity, Algebra i Logika, 26,N.1(1987),pp. 3–21.
5. M. Furst, J.B. Saxe and M. Sipser, Parity, circuits and the polynomial time hierarchy, Proc. 22nd FOCS (1981),pp.260–270.