𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The fault tolerance of NP-hard problems

✍ Scribed by Christian Glaßer; A. Pavan; Stephen Travers

Book ID
113641945
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
321 KB
Volume
209
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The STO-problem is NP-hard
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.

The planar -means problem is NP-hard
The planar -means problem is NP-hard
✍ Meena Mahajan; Prajakta Nimbhorkar; Kasturi Varadarajan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 282 KB