✦ LIBER ✦

Diagonal matrix scaling is NP-hard

✍ Scribed by Leonid Khachiyan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Well-Conditioned Similarities to

✍ M. Gu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Diagonal Scaling to an Orthogonal Matrix

✍ Berman, A.; Parlett, B. N.; Plemmons, R. J. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics ⚖ 793 KB

Diagonal Matrix Scaling and Linear Progr

✍ Khachiyan, Leonid; Kalantari, Bahman 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 478 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