✦ LIBER ✦

On estimating the complexity of logarithmic decompositions

✍ Scribed by Marc Bezem; Jan Van Leeuwen

Book ID: 113163302
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 444 KB
Volume: 26
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90190-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the algorithmic effectiveness of digr

On the algorithmic effectiveness of digraph decompositions and complexity measures

✍ Michael Lampis; Georgia Kaouri; Valia Mitsou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 321 KB

On the law of the logarithm for density

On the law of the logarithm for density estimators

✍ Peter Hall 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Complexity analysis of logarithmic barri

Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

✍ Zhi-Quan Luo; C. Roos; T. Terlaky 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 816 KB

In this paper, we analyze a logarithmic barrier decomposition method for solving a semi-infinite linear programming problem. This method is in some respects similar to the column generation methods using analytic centers. Although the method was found to be very efficient in the recent computational

On estimation of the logarithmic Sobolev

On estimation of the logarithmic Sobolev constant and gradient estimates of heat semigroups

✍ Feng-Yu Wang 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 182 KB

On the Complexity of Estimating the Size

On the Complexity of Estimating the Size of a Test Set

✍ Krishnamurthy, Balakrishnan; Akers, Sheldon B. 📂 Article 📅 1984 🏛 IEEE 🌐 English ⚖ 796 KB

Logarithmic Sobolev inequalities and hyp

Logarithmic Sobolev inequalities and hypercontractive estimates on the circle

✍ Fred B Weissler 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 763 KB