A Lower Bound on the Size of Decomposable Negation Normal Form.

Thammanit Pipatsrisawat Adnan Darwiche

Published in: AAAI (2010)

Keyphrases

lower bound
upper bound
decomposable negation normal form
branch and bound
branch and bound algorithm
lower and upper bounds
objective function
np hard
lower bounding
genetic algorithm
computational complexity
special case
maximum number
linear programming relaxation
running times
constant factor