✦ LIBER ✦

Lower Bounds and Impossibility Results for

✍ Scribed by Yehuda Lindell

Book ID: 105839902
Publisher: Springer
Year: 2007
Tongue: English
Weight: 603 KB
Volume: 21
Category: Article
ISSN: 0933-2790
DOI: 10.1007/s00145-007-9015-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Impossibility Results and Lower Bounds f

Impossibility Results and Lower Bounds for Consensus under Link Failures

✍ Schmid, Ulrich; Weiss, Bettina; Keidar, Idit 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 504 KB

Asymptotic upper and lower bounds for re

Asymptotic upper and lower bounds for results of extrapolation methods

✍ Roland Bulirsch; Josef Stoer 📂 Article 📅 1966 🏛 Springer-Verlag 🌐 English ⚖ 468 KB

New Lower Bounds and Hierarchy Results f

New Lower Bounds and Hierarchy Results for Restricted Branching Programs

✍ Detlef Sieling 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

In unrestricted branching programs all variables may be tested arbitrarily often on each path. But exponential lower bounds are only known if on each path the number of tests of each variable is bounded. We examine branching programs in which for each path the number of variables that are tested mor

Possibility and Impossibility Results fo

Possibility and Impossibility Results for Selective Decommitments

✍ Dennis Hofheinz 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 639 KB

Lower Bounds for Kernelizations and

✍ Yijia Chen; Jörg Flum; Moritz Müller 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 1011 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