论文信息 - New bounds on formula size

New bounds on formula size

A variety of theorems bounding the formula size of rather simple Boolean functions are described here for the first time. The principal results are improved lower and upper bounds for symmetric functions.

Mike Paterson

[1] L. H. Harper,et al. On the complexity of the marriage problem , 1972 .

[2] E. Specker,et al. Lengths of Formulas and Elimination of Quantifiers I , 1968 .

[3] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[4] M. Paterson. An Introduction to Boolean Function Complexity. , 1976 .

[5] Vaughan R. Pratt,et al. The effect of basis on size of Boolean expressions , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6] William F. McColl. Some results on circuit depth , 1976 .

[7] Michael J. Fischer,et al. Lower bounds on the size of Boolean formulas: Preliminary Report , 1975, STOC '75.

[8] Wolfgang J. Paul. A 2.5 n-lower bound on the combinational complexity of Boolean functions , 1975, STOC '75.

[9] John E. Savage,et al. The Complexity of Computing , 1976 .

[10] Kurt Mehlhorn,et al. An Improved Lower Bound on the Formula Complexity of Context-free Recognition , 1976, J. Inf. Process. Cybern..