✦ LIBER ✦

Some Polynomial and Integer Divisibility Problems are $NP$-Hard

✍ Scribed by Plaisted, David

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

In some curved spaces, one can solve NP-

✍ V. Kreinovich; M. Margenstern 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 266 KB

NP-hardness of deciding convexity of qua

✍ Amir Ali Ahmadi, Alex Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 274 KB

Some observations on the probabilistic a

✍ Ker-I Ko 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 673 KB