The discrepancy of unsatisfiable matrices and a lower bound for the Komlós conjecture constant.
Dmitriy KuniskyPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- constant factor
- worst case
- branch and bound
- objective function
- arbitrarily close
- phase transition
- np hard
- singular value decomposition
- sufficiently accurate
- lower bounding
- optimal solution
- online algorithms
- max sat
- sample complexity
- original data
- constraint satisfaction
- unsatisfiable cores