✦ LIBER ✦

Lower bounds for characteristic values

✍ Scribed by R.M Redheffer

Publisher: Elsevier Science
Year: 1966
Tongue: English
Weight: 140 KB
Volume: 16
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(66)90167-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper and lower bounds for expectation v

Upper and lower bounds for expectation values

✍ P.S.C. Wang 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A lower bound for the smallest singular

A lower bound for the smallest singular value

✍ Y.P. Hong; C.-T. Pan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

The lower bounds of the characteristic v

The lower bounds of the characteristic values of the simplest non-linear equations of a scalar field

✍ B.V. Gisin 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 219 KB

Lower Bounds for Shellsort

✍ C.Greg Plaxton; Torsten Suel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We show lower bounds on the worst-case complexity of Shellsort. In particular, Ž Ž 2 . Ž . 2 . we give a fairly simple proof of an ⍀ n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o

Convex upper and lower bounds for presen

Convex upper and lower bounds for present value functions

✍ D. Vyncke; M. Goovaerts; J. Dhaene 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 1 views