On Computation Complexity of True Proof Number Search

02/08/2021
by   Chao Gao, et al.
0

We point out that the computation of true proof and 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard

We prove that deciding whether the Runner can win this turn (mate-in-1) ...
research
01/13/2022

Finding (s,d)-Hypernetworks in F-Hypergraphs is NP-Hard

We consider the problem of computing an (s,d)-hypernetwork in an acyclic...
research
01/17/2023

Calculating lexicase selection probabilities is NP-Hard

Calculating the probability of an individual solution being selected und...
research
03/30/2021

On AO*, Proof Number Search and Minimax Search

We discuss the interconnections between AO*, adversarial game-searching ...
research
08/12/2020

On the complexity of finding a local minimizer of a quadratic function over a polytope

We show that unless P=NP, there cannot be a polynomial-time algorithm th...
research
12/04/2018

Rigid Foldability is NP-Hard

In this paper, we show that deciding rigid foldability of a given crease...
research
09/05/2018

Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness

Bootstrap percolation is a class of cellular automata with random initia...

Please sign up or login with your details

Forgot password? Click here to reset