✦ LIBER ✦

Computing the Minimum Fill-In is NP-Complete

✍ Scribed by Yannakakis, Mihalis

Book ID: 118212383
Publisher: Society for Industrial and Applied Mathematics
Year: 1981
Weight: 390 KB
Volume: 2
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0602010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Manhattan Network is NP-Complete

✍ Francis Y. L. Chin; Zeyu Guo; He Sun 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 854 KB

Computing the dimension ofN-free ordered

Computing the dimension ofN-free ordered sets is NP-complete

✍ H. A. Kierstead; S. G. Penrice 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 151 KB

Minimum-weight triangulation is NP-hard

✍ Mulzer, Wolfgang; Rote, Günter 📂 Article 📅 2008 🏛 Association for Computing Machinery 🌐 English ⚖ 707 KB

Minimum-weight triangulation is NP-hard

✍ Mulzer, Wolfgang; Rote, Günter 📂 Article 📅 2008 🏛 Association for Computing Machinery 🌐 English ⚖ 707 KB

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

Routing with Minimum Wire Length in the

Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete

✍ Szkaliczki, Tibor 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 185 KB