✦ LIBER ✦

Equivalence of Two Lower Bound Methods

✍ Scribed by M.G. Marmorino

Book ID: 110346467
Publisher: Springer
Year: 2002
Tongue: English
Weight: 86 KB
Volume: 31
Category: Article
ISSN: 0259-9791
DOI: 10.1023/a:1016226932236

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Equivalence of two Fourier methods for b

Equivalence of two Fourier methods for biological sequences

✍ Eivind Coward 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 226 KB

On the equivalence of the max-min transp

On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems

✍ Yunpeng Pan; Leyuan Shi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

Some features of the two-parameter modif

Some features of the two-parameter modified Kadanoff lower bound renormalization group method

✍ Hsing-mei Huang; Yu-ming Shih 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Two lower bounds in asynchronous distrib

Two lower bounds in asynchronous distributed computation

✍ Pavol Duris; Zvi Galil 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 858 KB

Two embedding theorems for lower bounded

Two embedding theorems for lower bounded lattices

✍ K. V. Adaricheva 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 280 KB