The Complexity of the Falsifiability Problem for Pure Implicational Formulas.

Published in: MFCS (1995)

Keyphrases

worst case
computational cost
real world
bayesian networks
computational complexity
evolutionary algorithm
upper bound
np complete
propositional formulas