✦ LIBER ✦

Computing the Stopping Distance of a Tanner Graph Is NP-Hard

✍ Scribed by Krishnan, K.M.; Shankar, P.

Book ID: 114640717
Publisher: IEEE
Year: 2007
Tongue: English
Weight: 139 KB
Volume: 53
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2007.896864

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Computing the norm ∥ A ∥∞,1 is NP-hard ∗

✍ Rohn, Jiří 📂 Article 📅 2000 🏛 Taylor and Francis Group 🌐 English ⚖ 221 KB

Computing the Value of a Boolean Express

Computing the Value of a Boolean Expression with Interval Inputs is NP-Hard

✍ Leticia S. Chee 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 652 KB

Note Computing the nucleolus of min-cost

Note Computing the nucleolus of min-cost spanning tree games is NP-hard

✍ Ulrich Faigle; Walter Kern; Jeroen Kuipers 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Minimizing the size of an identifying or

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

✍ Irène Charon; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let G = (V; E) be an undirected graph and C a subset of vertices. If the sets Br(v) ∩ C, v ∈ V (respectively, v ∈ V \C), are all nonempty and di erent, where Br(v) denotes the set of all points within distance r from v, we call C an r-identifying code (respectively, an r-locating-dominating code). W

Finding the smallest binarization of a C

Finding the smallest binarization of a CFG is NP-hard

✍ Gómez-Rodríguez, Carlos 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 248 KB