✦ LIBER ✦

Lower bounds on type checking overloading

✍ Scribed by Dennis M. Volpano

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 439 KB
Volume: 57
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00184-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on cube simplexity

✍ Robert B. Hughes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 856 KB

On attainable Cramér - Rao type lower bo

On attainable Cramér - Rao type lower bounds for weighted loss functions

✍ Piotr W Mikulski; Michael Monsour 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Lower bounds of Copson type for Hausdorf

Lower bounds of Copson type for Hausdorff matrices

✍ Chang-Pao Chen; Kuo-Zhong Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Lower bounds of Copson type for Nörlund

Lower bounds of Copson type for Nörlund matrices

✍ Chang-Pao Chen; Meng-Kuang Kuo; Kuo-Zhong Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Let A = (a n,k ) n,k 0 be a non-negative matrix. Denote by L p,q (A) the supremum of those L satisfying AX q L X p (X ∈ p , X 0), and define L (p),q (A) = L p,q (A) (p > 0). We derive a range for the value of L p,q (A NM W ), where 0 < q p < 1 and A NM W denotes the Nörlund matrix associated with th

Improved lower bounds on k-independence

✍ Yair Caro; Zsolt Tuza 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

## Abstract A vertex set __Y__ in a (hyper)graph is called __k__‐independent if in the sub(hyper)‐graph induced by __Y__ every vertex is incident to less than __k__ edges. We prove a lower bound for the maximum cardinality of a __k__‐independent set—in terms of degree sequences—which strengthens an

Lower bounds on multiple difference sets

✍ Wende Chen; Torleiv Kløve 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 568 KB

We give a lower bound on the maximal element in a multiple difference set.