On Computation Complexity of True Proof Number Search
Computational Complexity
2021-02-10 v1 Artificial Intelligence
Abstract
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.
Keywords
Cite
@article{arxiv.2102.04907,
title = {On Computation Complexity of True Proof Number Search},
author = {Chao Gao},
journal= {arXiv preprint arXiv:2102.04907},
year = {2021}
}
Comments
5 pages, short. Specific discussion on a narrow topic