✦ LIBER ✦

A new upper bound for Shellsort

✍ Scribed by Robert Sedgewick

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 796 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90001-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved upper bounds on shellsort

✍ Janet Incerpi; Robert Sedgewick 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 835 KB

Lower Bounds for Shellsort

✍ C.Greg Plaxton; Torsten Suel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We show lower bounds on the worst-case complexity of Shellsort. In particular, Ž Ž 2 . Ž . 2 . we give a fairly simple proof of an ⍀ n lg n r lg lg n lower bound for the size of Shellsort sorting networks for arbitrary increment sequences. We also show an identical lower bound for the running time o

Tight lower bounds for Shellsort

✍ Mark Allen Weiss; Robert Sedgewick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 541 KB

A New Upper Bound for B2[2] Sets

✍ Alain Plagne 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

New Upper Bounds for Maximum Satisfiabil

New Upper Bounds for Maximum Satisfiability

✍ Rolf Niedermeier; Peter Rossmanith 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 168 KB

The unweighted Maximum Satisfiability problem MAXSAT is: Given a Boolean formula in conjunctive normal form, find a truth assignment that satisfies the largest number of clauses. This paper describes exact algorithms that provide new Ž< < upper bounds for MAXSAT. We prove that MAXSAT can be solved i

New Upper Bounds for Ramsey Numbers

✍ Y.R Huang; K.M Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.