✦ LIBER ✦

Minimum weight Euclidean t-spanner is NP-hard

✍ Scribed by Carmi, Paz; Chaitman-Yerushalmi, Lilach

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum-weight triangulation is NP-hard

✍ Mulzer, Wolfgang; Rote, Günter 📂 Article 📅 2008 🏛 Association for Computing Machinery 🌐 English ⚖ 707 KB

Minimum-weight triangulation is NP-hard

✍ Mulzer, Wolfgang; Rote, Günter 📂 Article 📅 2008 🏛 Association for Computing Machinery 🌐 English ⚖ 707 KB

The realization problem for Euclidean mi

✍ P. Eades and S. Whitesides 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 419 KB

The minimum-length generator sequence pr

✍ S Even; O Goldreich 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Minimum Propositional Proof Length Is NP

✍ Michael Alekhnovich, Sam Buss, Shlomo Moran and Toniann Pitassi 📂 Article 📅 2001 🏛 Association for Symbolic Logic 🌐 English ⚖ 459 KB

Minimum area layout of series-parallel t

✍ Chakravarty, S.; He, X.; Ravi, S.S. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 756 KB