New bounds on formula size

This publication has 8 references indexed in Scilit:

• An Improved Lower Bound on the Formula Complexity of Context-free Recognition
  Published by Walter de Gruyter GmbH ,1976
• The effect of basis on size of Boolean expressions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• Lower bounds on the size of Boolean formulas
  Published by Association for Computing Machinery (ACM) ,1975
• A 2.5 n-lower bound on the combinational complexity of Boolean functions
  Published by Association for Computing Machinery (ACM) ,1975
• On the complexity of the marriage problem
  Advances in Mathematics, 1972
• The Logical Complexity of Geometric Properties in the Plane
  Journal of the ACM, 1970
• Lengths of Formulas and Elimination of Quantifiers I
  Published by Elsevier ,1968
• The Synthesis of Two-Terminal Switching Circuits
  Bell System Technical Journal, 1949