✦ LIBER ✦

Lower bounds for the electric susceptibility

✍ Scribed by Roger Martens

Book ID: 103892075
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 311 KB
Volume: 97
Category: Article
ISSN: 0378-4371
DOI: 10.1016/0378-4371(79)90118-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds on the magneto-electric sus

Upper bounds on the magneto-electric susceptibility

✍ E. Ascher; A.G.M. Janner 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 54 KB

Lower and upper bounds on the fidelity s

Lower and upper bounds on the fidelity susceptibility

✍ Brankov, J.; Tonchev, N. 📂 Article 📅 2012 🏛 The American Physical Society 🌐 English ⚖ 183 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

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

Lower bounds for matrices

✍ Grahame Bennett 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 843 KB

Lower bounds for the polynomial calculus

✍ A.A. Razborov 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 523 KB