✦ LIBER ✦

An ω(√n) lower bound for the nonoptimality of the greedy triangulation

✍ Scribed by Christos Levcopoulos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Ω(n log n) lower bound for decomposin

✍ Peter A. Bloniarz; S.S. Ravi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 578 KB

An Ω(n4/3) lower bound on the randomized

✍ Péter Hajnal 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 657 KB

An Ω(n5/4) lower bound on the randomized

✍ Valerie King 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 546 KB

An Ω(n43) lower bound on the monotone ne

✍ Norbert Blum 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 510 KB

On the Ω(n log n) lower bound for convex

✍ Peter van Emde Boas 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An upper bound for the number of planar

✍ Emile E. Anclin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 121 KB