The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant.
Dmitriy KuniskyPublished in: SIAM J. Discret. Math. (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- arbitrarily close
- lower and upper bounds
- objective function
- np hard
- unsatisfiable cores
- constant factor
- max sat
- singular value decomposition
- phase transition
- sat solvers
- polynomial approximation
- worst case
- linear programming relaxation
- optimal solution
- lower bounding
- linear program
- sample complexity
- orders of magnitude
- xpath queries
- pairwise comparison
- search algorithm
- learning algorithm