Computing the Stopping Distance of a Tanner Graph Is NP-Hard (Q3548264)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Stopping Distance of a Tanner Graph Is NP-Hard |
scientific article |
Statements
Computing the Stopping Distance of a Tanner Graph Is NP-Hard (English)
0 references
21 December 2008
0 references