1. Proceedings of the 29-th Annual IEEE Symposium on Foundations of Computer Science;M Ajtai,1988
2. B. Alon and R. BoppanaThe monotone circuit complexity of Boolean functionsCombinatorica, 7 (1987), pp. 1–22.
3. M. L. BonetThe Lengths of Propositional Proofs and the Deduction RulePhD thesis, U.C. Berkeley, 1991.
4. M. L. Bonet and S. R. BussSize-depth tradeoffs for Boolean formulasInformation Processing Letters, 29 (1994), pp. 151–155.
5. M. L. Bonet, T. Pitassi, and R. RazLower bounds for cutting planes proofs with small coefficientsJournal of Symbolic Logic, 62 (1997), pp. 708–728. An earlier version appeared in Proc. Twenty-Seventh Annual ACM Symposium on the Theory of Computing 1995, pp. 575–584.