✦ LIBER ✦

Co-NP-completeness of some matrix classification problems

✍ Scribed by Paul Tseng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The P-matrix problem is co-NP-complete

✍ Gregory E. Coxson 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 312 KB

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

Strong NP-completeness of a matrix simil

✍ V. Brimkov; B. Codenotti; M. Leoncini; G. Resta 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 469 KB

NP-Completeness of graph decomposition p

✍ Edith Cohen; Michael Tarsi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 689 KB

NP-completeness of minimum spanner probl

✍ Leizhen Cai 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB