✦ LIBER ✦

On the Exact Maximum Complexity of Minkowski Sums of Polytopes

✍ Scribed by Efi Fogel; Dan Halperin; Christophe Weibel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improvements to algorithms for computing

✍ Yanyan Wu; Jami J. Shah; Joseph K. Davidson 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 497 KB

On the fatness of Minkowski sums

✍ Mark de Berg; A. Frank van der Stappen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB

On the Christoffel-Minkowski problem of

✍ Changqing Hu; Xi-Nan Ma; Chunli Shen 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 200 KB

On the maximum of the minimum of a sum

✍ Ray Redheffer 📂 Article 📅 1987 🏛 Springer Vienna 🌐 English ⚖ 920 KB

On the Complexity of Polytope Isomorphis

✍ Volker Kaibel; Alexander Schwartz 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 222 KB

On the computational complexity of the m

✍ Z. -Q. Luo; D. L. Parnas 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 617 KB