BibTeX record journals/corr/abs-cs-0512101

download as .bib file

@article{DBLP:journals/corr/abs-cs-0512101,
  author       = {K. Murali Krishnan and
                  Priti Shankar},
  title        = {On the Complexity of finding Stopping Distance in Tanner Graphs},
  journal      = {CoRR},
  volume       = {abs/cs/0512101},
  year         = {2005},
  url          = {http://arxiv.org/abs/cs/0512101},
  eprinttype    = {arXiv},
  eprint       = {cs/0512101},
  timestamp    = {Wed, 24 Mar 2021 17:03:50 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0512101.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.