Size-Depth Tradeoffs for Boolean Fomulae

Abstract We present a simplified proof that Brent/Spira restructuring of Boolean formulas can be improved to allow a Boolean formula of size n to be transformed into an equivalent log depth formula of size O ( n α ) for arbitrary α >1.

[1]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[2]  Nader H. Bshouty,et al.  Size-depth tradeoffs for algebraic formulae , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.