Login / Signup
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
Hans Kleine Büning
Xishun Zhao
Published in:
Inf. Process. Lett. (2002)
Keyphrases
</>
computational complexity
computational cost
learning algorithm
worst case
computationally efficient
bayesian networks
significant improvement
unsatisfiable cores
machine learning
lower bound
special case
benchmark datasets
orders of magnitude
metaheuristic