✦ LIBER ✦

Length 3 Edge-Disjoint Paths Is NP-Hard

✍ Scribed by Alpert, Hannah; Iglesias, Jennifer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of some edge-disjoint pa

✍ Jens Vygen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The edge-disjoint 3-hop-constrained path

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; J. Mailfert 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 464 KB

The edge Hamiltonian path problem is NP-

✍ Alan A. Bertossi 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 354 KB

The minimum-length generator sequence pr

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

Finding good approximate vertex and edge

✍ Thang Nguyen Bui; Curt Jones 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 639 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