Login / Signup
Approximations by OBDDs and the variable ordering problem
Matthias Krause
Petr Savický
Ingo Wegener
Published in:
Electron. Colloquium Comput. Complex. (1999)
Keyphrases
</>
variable ordering
branch and bound algorithm
boolean functions
conflict directed
binary decision diagrams
model checking
forward checking
temporal logic
propositional satisfiability
ordered binary decision diagrams
max sat
genetic algorithm
computational complexity
upper bound
domain specific
orders of magnitude