✦ LIBER ✦

Lower bounds on the computational power of an optical model of computation

✍ Scribed by Damien Woods; J. Paul Gibson

Publisher: Springer Netherlands
Year: 2007
Tongue: English
Weight: 925 KB
Volume: 7
Category: Article
ISSN: 1567-7818
DOI: 10.1007/s11047-007-9039-7

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

Lower bounding aggregation and direct co

Lower bounding aggregation and direct computation for an infinite horizon one-reservoir model

✍ Bernard F. Lamond; Pascal Lang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 435 KB

A lower bound on the computational compl

A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer

✍ Eric Goles; Marcos Kiwi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Computation of a lower bound of the leng

Computation of a lower bound of the lengths of schedules

✍ T. A. Tushkina 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 284 KB

Some Bounds on the Computational Power o

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems

✍ O. Bournez 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 760 KB

Lower bounds on the stability number of

Lower bounds on the stability number of graphs computed in terms of degrees

✍ Owen Murphy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 246 KB