๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Lower bounds on the computational efficiency of optical computing systems

โœ Scribed by Barakat, Richard ;Reif, John

Book ID
115334871
Publisher
The Optical Society
Year
1987
Tongue
English
Weight
500 KB
Volume
26
Category
Article
ISSN
1559-128X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lower Bounds on the Depth of Monotone Ar
Lower Bounds on the Depth of Monotone Arithmetic Computations
โœ Don Coppersmith; Baruch Schieber ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

dedicated to zvi galil's 50th birthday Consider an arithmetic expression of length n involving only the operations [+, \_] and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We