Login / Signup

The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams.

Seiichiro TaniKiyoharu HamaguchiShuzo Yajima
Published in: ISAAC (1993)
Keyphrases
  • variable ordering
  • binary decision diagrams
  • branch and bound algorithm
  • dynamic programming
  • np complete
  • propositional satisfiability
  • optimal solution
  • space complexity