"Hardness of Approximation Results for the Problem of Finding the Stopping ..."

K. Murali Krishnan, L. Sunil Chandran (2006)

> Home

Details and statistics

DOI: 10.1007/11944836_9

access: closed

type: Conference or Workshop Paper

metadata version: 2021-03-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fsttcs/KrishnanC06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/KrishnanC06
K. Murali Krishnan, L. Sunil Chandran:
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. FSTTCS 2006: 69-80

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.