论文信息 - Size-depth tradeoffs for algebraic formulae

Size-depth tradeoffs for algebraic formulae

Some tradeoffs between the size and depth of algebraic formulas are proved. It is shown that, for any fixed in >0, any algebraic formula of size S can be converted into an equivalent formula of depth O(log S) and size O(S/sup 1+ in /). This result is an improvement over previously known results where, to obtain the same depth bound, the formula size is Omega (S/sup alpha /), with alpha >or=2.<<ETX>>

Nader H. Bshouty | Richard Cleve | Wayne Eberly

[1] S. Rao Kosaraju. Parallel Evaluation of Division-Free Arithmetic Expressions , 1986, STOC 1986.

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

[3] Samuel R. Buss,et al. The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[4] Samuel R. Buss,et al. An Optimal Parallel Algorithm for Formula Evaluation , 1992, SIAM J. Comput..

[5] Gary L. Miller,et al. Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6] David E. Muller,et al. Restructuring of Arithmetic Expressions For Parallel Evaluation , 1976, JACM.

[7] S. Rao Kosaraju,et al. A tree-partitioning technique with applications to expression evaluation and term matching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.