Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Complexity of finding Stopping Distance in Tanner Graphs   Two decision problems related to the computation of stopping sets in Tanner
graphs are shown to be NP-complete. NP-hardness of the problem of computing the
stopping distance of a Tanner graph follows as a consequence

24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
15
The categories of this paper are: nucl-ex
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th