✦ LIBER ✦

GPSG-Recognition Is NP-Hard

✍ Scribed by Eric Sven Ristad

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

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

Diagonal matrix scaling is NP-hard

✍ Leonid Khachiyan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Checking robust nonsingularity is NP-har

✍ Svatopluk Poljak; Jiří Rohn 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 414 KB