On the complexity of choosing the branching literal in DPLL.

Paolo Liberatore

Published in: Artif. Intell. (2000)

Keyphrases

search tree
worst case
search algorithm
computational complexity
np complete
neural network
branch and bound
machine learning
lower bound
special case