Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams.
Luke FriedmanYixin XuPublished in: CSR (2013)
Keyphrases
- lower bound
- ordered binary decision diagrams
- upper bound
- average case complexity
- branch and bound algorithm
- deterministic finite automaton
- randomly generated
- objective function
- model checking
- branch and bound
- worst case
- optimal solution
- constraint satisfaction problems
- simulated annealing
- linear programming
- vc dimension