✦ LIBER ✦

Comparison of certain methods of computing the lower bounds of shortest schedules

✍ Scribed by Yu. P. Laptin

Publisher: Springer US
Year: 1978
Tongue: English
Weight: 368 KB
Volume: 14
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069311

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of lower bounds to the length

Comparison of lower bounds to the lengths of deterministic multiprocessor schedules

✍ A. I. Kuksa 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 475 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

Methods for computing lower bounds to ei

Methods for computing lower bounds to eigenvalues of self-adjoint operators

✍ Christopher Beattie; Friedrich Goerisch 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 269 KB

Lower bounds for the distributions of ce

Lower bounds for the distributions of certain multivariate test statistics

✍ Yasunori Fujikoshi; Takafumi Isogai 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A comparison of two lower-bound methods

A comparison of two lower-bound methods for communication complexity

✍ Martin Dietzfelbinger; Juraj Hromkovič; Georg Schnitger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 835 KB

The methods "Rank" and "Fooling Set" for proving lower bounds on the deterministic communication complexity of Boolean functions are compared. The main results are as follows. (i) For almost all Boolean functions of 2n variables the Rank method provides the lower bound n on communication complexity

Computing tight upper bounds on the alge

Computing tight upper bounds on the algebraic connectivity of certain graphs

✍ Oscar Rojo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 176 KB