𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Lower Bound for Rational Approximations to π

✍ Scribed by M. Hata

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
436 KB
Volume
43
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity Lower Bounds for Approximatio
Complexity Lower Bounds for Approximation Algebraic Computation Trees
✍ Felipe Cucker; Dima Grigoriev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 159 KB

We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions.

A Lower Bound for Primality
A Lower Bound for Primality
✍ Eric Allender; Michael Saks; Igor Shparlinski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Recent work by Bernasconi, Damm, and Shparlinski showed that the set of square-free numbers is not in AC 0 and raised as an open question whether similar (or stronger) lower bounds could be proved for the set of prime numbers. We show that the Boolean majority function is AC 0 -Turing reducible to t

Lower convex order bound approximations
Lower convex order bound approximations for sums of log-skew normal random variables
✍ Oriol Roch; Emiliano A. Valdez 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

When it comes to modeling dependent random variables, not surprisingly, the multivariate normal distribution has received the most attention because of its many appealing properties. However, when it comes to practical implementation, the same family of distribution is often rejected for modeling fi

A lower bound for level spacings
A lower bound for level spacings
✍ Elliott H Lieb; Walter E Thirring 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 352 KB

We consider a single particle in a negative potential V: H = --d + V(x). A lower bound is found for the quantity +I -EW, where cm is the ground-state energy of H in all space and where EA is the ground-state energy of H in a bounded domain A with Dirichlet ($ = 0) boundary conditions. Our estimate f

A lower bound for partial list colorings
A lower bound for partial list colorings
✍ Chappell, Glenn G. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Let G be an n-vertex graph with list-chromatic number χ . Suppose that each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas [1] conjecture that at least t n /χ vertices can be colored from these lists. We prove a lower bound for the number of colorable vertices. As a coroll