✦ LIBER ✦

The planar -means problem is NP-hard

✍ Scribed by Meena Mahajan; Prajakta Nimbhorkar; Kasturi Varadarajan

Book ID: 113927358
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 282 KB
Volume: 442
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.05.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 5431 || The Planar k-Means Problem is NP-Hard

✍ Das, Sandip; Uehara, Ryuhei 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 438 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.

The Planar Hamiltonian Circuit Problem i

The Planar Hamiltonian Circuit Problem is NP-Complete

✍ Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 768 KB

The minimum-length generator sequence pr

The minimum-length generator sequence problem is NP-hard

✍ S Even; O Goldreich 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Space-time isomorphism problem is intrac

Space-time isomorphism problem is intractable (NP-hard)

✍ Vladik Kreinovich 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 451 KB

Computation of lucky number of planar gr

Computation of lucky number of planar graphs is NP-hard

✍ A. Ahadi; A. Dehghan; M. Kazemi; E. Mollaahmadi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 198 KB