Two-pebbling and odd-two-pebbling are not equivalent.

Charles A. Cusack Airat Bekmetjev Mark Powers

Published in: Discret. Math. (2019)

Keyphrases

clause learning
sat solvers
sat problem
satisfiability problem
propositional satisfiability
orders of magnitude
max sat
machine learning
lower bound
np complete