An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Olga TveretinaCarsten SinzHans ZantemaPublished in: ACAC (2009)
Keyphrases
- lower bound
- upper bound
- average case complexity
- cnf formula
- lower and upper bounds
- max sat
- np hard
- branch and bound
- boolean functions
- branch and bound algorithm
- objective function
- worst case
- optimal solution
- upper and lower bounds
- theorem prover
- model checking
- knowledge compilation
- lower bounding
- mathematical formulas
- ordered binary decision diagrams
- np complete
- reinforcement learning
- computational complexity
- deterministic domains