Improving the Variable Ordering of OBDDs Is NP-Complete.
Beate BolligIngo WegenerPublished in: IEEE Trans. Computers (1996)
Keyphrases
- np complete
- variable ordering
- branch and bound algorithm
- randomly generated
- np hard
- boolean functions
- propositional satisfiability
- max sat
- sat problem
- conflict directed
- satisfiability problem
- lower bound
- computational complexity
- objective function
- branch and bound
- np complete problems
- forward checking
- constraint satisfaction problems
- optimization problems
- upper bound
- knowledge representation