✦ LIBER ✦

Logarithmic lower bounds for Néel walls

✍ Scribed by Christof Melcher

Book ID: 106175948
Publisher: Springer
Year: 2004
Tongue: English
Weight: 149 KB
Volume: 21
Category: Article
ISSN: 0944-2669
DOI: 10.1007/s00526-003-0253-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Logarithmic Tail of Néel Walls

✍ Christof Melcher 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 276 KB

Logarithmic Dimension Bounds for

✍ Ioannis Parissis 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 294 KB

Lower bounds for the modulus of the loga

Lower bounds for the modulus of the logarithmic derivative of a polynomial

✍ N. V. Govorov; Yu. P. Lapenko 📂 Article 📅 1978 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 262 KB

A lower bound for n-diameters

✍ I. F. Sharygin 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 217 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