✦ LIBER ✦

Lower bounds for sampling algorithms for estimating the average

✍ Scribed by Ran Canetti; Guy Even; Oded Goldreich

Book ID: 107766193
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 655 KB
Volume: 53
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00171-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for the average genus

✍ Jianer Chen; Jonathan L. Gross; Robert G. Rieper 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

Two lower bounds are obtained for the average genus of graphs. The average genus for a graph of maximum valence at most 3 is at least half its maximum genus, and the average genus for a 2-connected simplicial graph other than a cycle is at least 1/16 of its cycle rank.

Submodular Approximation: Sampling-based

Submodular Approximation: Sampling-based Algorithms and Lower Bounds

✍ Svitkina, Zoya; Fleischer, Lisa 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 314 KB

Lower complexity bounds for interpolatio

Lower complexity bounds for interpolation algorithms

✍ Nardo Giménez; Joos Heintz; Guillermo Matera; Pablo Solernó 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Average errors for zero finding: Lower b

Average errors for zero finding: Lower bounds

✍ Erich Novak; Klaus Ritter 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 French ⚖ 659 KB

Remarks on the lower bounds for the aver

Remarks on the lower bounds for the average genus

✍ Yi-chao Chen 📂 Article 📅 2011 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 230 KB

Estimating confidence lower bounds for W

Estimating confidence lower bounds for Weibull percentiles

✍ B. Birgören 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 70 KB