Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Computing the Stopping Distance of a Tanner Graph Is NP-Hard."

Karunakaran Murali Krishnan, Priti Shankar (2007)

> Home

Details and statistics

DOI: 10.1109/TIT.2007.896864

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/KrishnanS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/KrishnanS07
Karunakaran Murali Krishnan, Priti Shankar:
Computing the Stopping Distance of a Tanner Graph Is NP-Hard. IEEE Trans. Inf. Theory 53(6): 2278-2280 (2007)

a service of

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.