✦ LIBER ✦

Optimal lower bound for unions

✍ Scribed by Richard M. Bennett

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 73 KB
Volume: 5
Category: Article
ISSN: 0167-4730
DOI: 10.1016/0167-4730(88)90032-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal lower bound for nonregular la

An optimal lower bound for nonregular languages

✍ Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 310 KB

An optimal lower bound for the Frobenius

An optimal lower bound for the Frobenius problem

✍ Iskander M. Aliev; Peter M. Gruber 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 127 KB

Given N 2 positive integers a 1 , a 2 , . . . , a N with GCD(a 1 , . . . , a N ) = 1, let f N denote the largest natural number which is not a positive integer combination of a 1 , . . . , a N . This paper gives an optimal lower bound for f N in terms of the absolute inhomogeneous minimum of the sta

A lower bound on the probability of a un

A lower bound on the probability of a union

✍ D. de Caen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Zero density lower bounds in topology op

Zero density lower bounds in topology optimization

✍ T.E. Bruns 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 760 KB

In topology optimization, the notion of topology is introduced into the analysis by assigning density design variables to positions throughout the design domain. The standard practice is to set the lower bound values of the density design variables so that they are small but nonzero values. The inte

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