✦ LIBER ✦

Checking robust nonsingularity is NP-hard

✍ Scribed by Svatopluk Poljak; Jiří Rohn

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Checking robust nonsingularity of tridia

✍ Ilan Bar-On; Bruno Codenotti; Mauro Leoncini 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 600 KB

Checking local optimality in constrained

✍ P.M. Pardalos; G. Schnitger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Checking bounds on solutions of linear i

✍ Jiří Rohn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 246 KB

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