✦ LIBER ✦

NP-completeness of some problems of choosing a vector subset

✍ Scribed by A. V. Kel’manov; A. V. Pyatkin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of some edge-disjoint pa

✍ Jens Vygen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

NP-completeness of some problems concern

✍ K. Prasad; J. S. Kelly 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 349 KB

Co-NP-completeness of some matrix classi

✍ Paul Tseng 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 92 KB

The NP-Completeness of Some Edge-Partiti

✍ Holyer, Ian 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 474 KB

On a version of the problem of choosing

✍ A. V. Kel’manov; A. V. Pyatkin 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 528 KB

NP-completeness of some problems of part

✍ B. Péroche 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 794 KB