On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract).
Detlef SielingPublished in: STACS (1998)
Keyphrases
- extended abstract
- approximation schemes
- approximation algorithms
- deterministic domains
- special case
- np hard
- objective function
- decomposable negation normal form
- worst case
- boolean functions
- model checking
- planning problems
- symbolic model checking
- computational complexity
- multiresolution
- lower bound
- ordered binary decision diagrams