Oliver Bodemer
IBM J. Res. Dev
Consider the problem of computing the product a1A(1)⋯A(t)b, where A(1),...,A(t) are n × n matrices, a and b are vectors. We show that the size s and depth d of monotone arithmetic circuits for this problem are related as s + n3d = Ω(tn3) Thus, a reduction to depth d = o(t) requires an increase from (optimal) size n2t to size n3t. A similar trade-off is shown for the evaluation of linear recurrences. © 1991.
Oliver Bodemer
IBM J. Res. Dev
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
György E. Révész
Theoretical Computer Science