✦ LIBER ✦

The P-matrix problem is co-NP-complete

✍ Scribed by Gregory E. Coxson

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 312 KB
Volume: 64
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582570

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The STO problem is NP-complete

✍ P. Krysta; L. Pacholski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 233 KB

We prove that the problem STO of deciding whether or not a finite set E of term equations is subject to occur-check is in NP. E is subject to occur-check if the execution of the Martelli-Montanari unification algorithm gives for input E a set E ∪ {x = t}, where t = x and x appears in t. Apt et al. (

Co-NP-completeness of some matrix classi

Co-NP-completeness of some matrix classification problems

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

The graph genus problem is NP-complete

✍ Carsten Thomassen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Permuted max-algebraic eigenvector probl

Permuted max-algebraic eigenvector problem is NP-complete

✍ P. Butkovič 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let a ⊕ b = max(a, b) and a ⊗ b = a + b for a, b ∈ R := R ∪ {-∞} and extend these operations to matrices and vectors as in conventional linear algebra. The following eigenvector problem has been intensively studied in the past: Given A ∈ R n×n find all x ∈ R n , x / = (-∞, . . . , -∞) T (eigenvector

The shortest common nonsubsequence probl

The shortest common nonsubsequence problem is NP-complete

✍ M. Middendorf 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The maximum edge biclique problem is NP-

The maximum edge biclique problem is NP-complete

✍ René Peeters 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 93 KB

We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.