Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs

DOI10.1007/11944836_9zbMath1177.68097OpenAlexW1555985201MaRDI QIDQ5385974

No author found.

Publication date: 17 April 2008

Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11944836_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the complexity of and solutions to the minimum stopping and trapping set problems

This page was built for publication: Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs