Lower Bounds on OBDD Proofs with Several Orders.
Sam BussDmitry ItsyksonAlexander KnopArtur RiazanovDmitry SokolovPublished in: ACM Trans. Comput. Log. (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- boolean functions
- model counting
- optimal solution
- theorem prover
- ordered binary decision diagrams
- model checking
- knowledge compilation
- natural deduction
- deterministic domains
- theorem proving
- equational theories
- mathematical proofs
- decision procedures
- lower and upper bounds
- max sat
- vc dimension
- sample complexity
- linear programming relaxation
- upper and lower bounds
- objective function
- quadratic assignment problem
- optimal cost
- learning theory
- dynamic programming
- decomposable negation normal form