On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization
Detlef SielingPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- approximation schemes
- approximation algorithms
- deterministic domains
- special case
- np hard
- worst case
- decomposable negation normal form
- objective function
- conp complete
- ordered binary decision diagrams
- np complete
- model checking
- reinforcement learning
- boolean functions
- planning problems
- lower bound
- heuristic search
- natural images
- wavelet transform
- upper bound
- congestion games
- image segmentation