Lower Bounds for Randomized Branching Programs with a Big OBDD Part
Rustam MubarakzjanovPublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (2000)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- randomized algorithm
- branch and bound algorithm
- np hard
- branch and bound
- objective function
- lower and upper bounds
- ordered binary decision diagrams
- worst case
- boolean functions
- deterministic domains
- optimal solution
- big data
- model checking
- deterministic finite automaton
- optimal cost
- upper and lower bounds
- vc dimension
- online algorithms
- decision forest
- model counting
- quadratic assignment problem
- linear programming relaxation
- knowledge compilation
- learning algorithm
- sample complexity