𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds on monotone complexity of the logical permanent

✍ Scribed by A. A. Razborov

Publisher
SP MAIK Nauka/Interperiodica
Year
1985
Tongue
English
Weight
619 KB
Volume
37
Category
Article
ISSN
0001-4346

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