✦ LIBER ✦

The shortest common nonsubsequence problem is NP-complete

✍ Scribed by M. Middendorf

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 337 KB
Volume: 108
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90200-d

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. (

The graph genus problem is NP-complete

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

The Hamiltonian circuit problem for circ

The Hamiltonian circuit problem for circle graphs is NP-complete

✍ Peter Damaschke 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 134 KB

The node-deletion problem for hereditary

The node-deletion problem for hereditary properties is NP-complete

✍ John M. Lewis; Mihalis Yannakakis 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 801 KB

The edge Hamiltonian path problem is NP-

The edge Hamiltonian path problem is NP-complete for bipartite graphs

✍ Ten-Hwang Lai; Shu-Shang Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 508 KB

The STO-problem is NP-hard

✍ Krzysztof R. Apt; Peter van Emde Boas; Angelo Welling 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 209 KB

A finite set of term equations \(E\) is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with \(E\) and ends with a failure due to occur-check. We prove here that the problem of deciding whether \(E\) is STO is NP-hard.