A lower bound on CNF encodings of the at-most-one constraint.
Petr KuceraPetr SavickýVojtech VorelPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- lower bound
- upper bound
- sat solving
- branch and bound
- optimal solution
- worst case
- branch and bound algorithm
- np hard
- objective function
- boolean functions
- sufficiently accurate
- boolean satisfiability
- sat instances
- sat solvers
- combinatorial problems
- lower and upper bounds
- upper and lower bounds
- linear constraints
- planning problems
- online algorithms
- orders of magnitude
- np complete
- special case