Lower Bounds on OBDD Proofs with Several Orders.
Sam BussDmitry ItsyksonAlexander KnopArtur RiazanovDmitry SokolovPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- theorem prover
- ordered binary decision diagrams
- boolean functions
- lower and upper bounds
- objective function
- theorem proving
- np hard
- optimal solution
- worst case
- model checking
- upper and lower bounds
- deterministic domains
- constraint satisfaction problems
- model counting
- mathematical proofs
- quadratic assignment problem
- online algorithms
- linear programming relaxation
- knowledge compilation
- max sat
- vc dimension
- natural deduction
- sample complexity
- special case
- learning algorithm
- deterministic finite automaton
- supply chain