A Lower Bound on CNF Encodings of the At-Most-One Constraint.
Petr KuceraPetr SavickýVojtech VorelPublished in: SAT (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- sat solving
- np hard
- branch and bound
- optimal solution
- lower and upper bounds
- boolean functions
- objective function
- boolean satisfiability
- lower bounding
- worst case
- sat instances
- sufficiently accurate
- sat encodings
- upper and lower bounds
- np complete
- non binary
- online algorithms
- vc dimension
- conjunctive normal form
- sample complexity
- learning algorithm