The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights.

Jiabao Lin Hanpin Wang

Published in: ICALP (2017)

Keyphrases

decision trees
case study
computational cost
domain specific
domain independent
decision problems
computational issues
data mining
blocks world
np hardness
solving problems
relative importance
problems involving
space complexity
worst case
multi objective
bayesian networks
genetic algorithm