A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth.

Friedrich Slivovsky Stefan Szeider

Published in: SAT (2020)

Keyphrases

space complexity
np hard
objective function
search space
randomly generated
learning algorithm
optimal solution
computational complexity
worst case
simulated annealing
integrity constraints