✦ LIBER ✦

Unshuffling a square is NP-hard

✍ Scribed by Buss, Sam; Soltys, Michael

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Storage allocation is NP-hard

✍ J.M. Robson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Terrain Guarding is NP-Hard

✍ King, James; Krohn, Erik 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 310 KB

GPSG-Recognition Is NP-Hard

✍ Eric Sven Ristad 📂 Article 📅 1987 🏛 MIT Press 🌐 English ⚖ 763 KB

NP-hardness of Euclidean sum-of-squares

✍ Daniel Aloise; Amit Deshpande; Pierre Hansen; Preyas Popat 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 261 KB

NP-hard sets are superterse unless NP is

✍ Yongge Wang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Recognizing tough graphs is NP-hard

✍ D. Bauer; S.L. Hakimi; E. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 326 KB