𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Development of a skew µ lower bound

✍ Scribed by Rod Holland; Peter Young; Chuanjiang Zhu

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
141 KB
Volume
15
Category
Article
ISSN
1049-8923

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Exploitation of the NP hard, mixed µ problem structure provides a polynomial time algorithm that approximates µ with usually reasonable answers. When the problem is extended to the skew µ problem an extension of the existing method to the skew µ formulation is required. The focus of this paper is to extend the µ lower bound derivation to the skew µ lower bound and show its direct computation by way of a power algorithm. Copyright © 2005 John Wiley & Sons, Ltd.

📜 SIMILAR VOLUMES

Development of a skew μ upper bound
Development of a skew μ upper bound
✍ Rod Holland; Peter Young; Chuanjiang Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB
A tight lower bound for top-down skew he
A tight lower bound for top-down skew heaps
✍ Berry Schoenmakers 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Previously, it was shown in a paper by Kaldewaij and Schoenmakers that for top-down skew heaps the amortized number of comparisons required for meld and delmin is upper bounded by log+ R, where n is the total size of the inputs to these operations and r#~ = (& + 1) /2 denotes the golden ratio. In th

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 matrix lower bound
A matrix lower bound
✍ Joseph F. Grcar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Four essentially different interpretations of a lower bound for linear operators are shown to be equivalent for matrices (involving inequalities, convex sets, minimax problems, and quotient spaces). Properties stated by von Neumann in a restricted case are satisfied by the lower bound. Applications

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