✦ LIBER ✦

Generating All Vertices of a Polyhedron Is Hard

✍ Scribed by Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled Elbassioni; Vladimir Gurvich

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding all vertices of a convex polyhed

✍ Miroslav Maňas; Josef Nedoma 📂 Article 📅 1968 🏛 Springer-Verlag 🌐 English ⚖ 252 KB

An algorithm for enumerating all vertice

✍ W. Altherr 📂 Article 📅 1975 🏛 Springer Vienna 🌐 English ⚖ 580 KB

Analysis of backtrack algorithms for lis

✍ Komei Fukuda; Thomas M. Liebling; François Margot 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 958 KB

A polyhedron with alls—tcuts as vertices

✍ Naveen Garg; Vijay V. Vazirani 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 561 KB

A polyhedron of genus 4 with minimal num

✍ Jürgen Bokowski; Ulrich Brehm 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 499 KB

On a class of functions attaining their

✍ Fabio Tardella 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 331 KB