✦ LIBER ✦

Lower bounds of the capacity of l-dimensional algebras of estimate-computing algorithms

✍ Scribed by V.L. Matrosov

Publisher: Elsevier Science
Year: 1984
Weight: 478 KB
Volume: 24
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(84)90030-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Capacity of algebraic extensions of a mo

Capacity of algebraic extensions of a model of estimate-computing algorithms

✍ V.L. Matrosov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 687 KB

Correct algebras of bounded capacity on

Correct algebras of bounded capacity on the set of algorithms of the calculation of estimates

✍ V.L. Matrosov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 996 KB

The completeness of a family of estimate

The completeness of a family of estimate-computing algorithms with continuous initial data

✍ A.R. Ashurov 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 312 KB

Algorithms for the rapid computation of

Algorithms for the rapid computation of response of an oscillator with bounded truncation error estimates

✍ V.G. Colvin; T.R. Morris 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 431 KB

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

The correctness of algebraic closures of

The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems

✍ T.V. Plokhonina 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 409 KB