✦ LIBER ✦

A lower bound on the probability of a union

✍ Scribed by D. de Caen

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 150 KB
Volume: 169
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00107-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of lower bounds on the Bayesian

A class of lower bounds on the Bayesian probability of error

✍ D.E. Boekee; J.C. Ruitenbeek 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 627 KB

A new lower bound for the critical proba

A new lower bound for the critical probability of site percolation on the square lattice

✍ J. van den Berg; A. Ermakov 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,

A lower bound on the single-operation wo

A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals

✍ Norbert Blum; Henning Rochow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Lower-bounds on the connectivities of a

Lower-bounds on the connectivities of a graph

✍ Abdol H. Esfahanian 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB 👁 1 views

Lower bounds on the vulnerability of a g

Lower bounds on the vulnerability of a graph

✍ F. T. Boesch 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

A Lower Bound on Blocking Semiovals

✍ Jeremy M. Dover 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 87 KB

A semioval in a projective plane is a set S of points such that for every point P ∈ S, there exists a unique line of such that ∩ S = {P}. In other words, at every point of S, there exists a unique tangent line. A blocking set in is a set B of points such that every line of contains at least one poin