Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings.

Luca Pulina Armando Tacchella

Published in: LPAR (2008)

Keyphrases

boolean logic
information theoretic
truth values
upper bound
search space
bounded treewidth
np complete
boolean functions
worst case
tree decompositions
machine learning
non binary
space complexity
np hard
computational complexity
approximation algorithms
lower bound