Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Computation Complexity of True Proof Number Search   We point out that the computation of true \emph{proof} and \emph{disproof}
numbers for proof number search in arbitrary directed acyclic graphs is
NP-hard, an important theoretical result for proof number search. The proof
requires a reduction from SAT, which demonstrates that finding true
proof/disproof number for arbitrary DAG is at least as hard as deciding if
arbitrary SAT instance is satisfiable, thus NP-hard.

21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int