Computing the Stopping Distance of a Tanner Graph Is NP-Hard (Q3548264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the Stopping Distance of a Tanner Graph Is NP-Hard |
scientific article; zbMATH DE number 5455508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the Stopping Distance of a Tanner Graph Is NP-Hard |
scientific article; zbMATH DE number 5455508 |
Statements
Computing the Stopping Distance of a Tanner Graph Is NP-Hard (English)
0 references
21 December 2008
0 references
0.8471894264221191
0 references
0.7945135831832886
0 references
0.770905613899231
0 references
0.770905613899231
0 references
0.7473868131637573
0 references
