Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices.
Prayaag VenkatPublished in: ITCS (2023)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- branch and bound algorithm
- lower bounding
- np hard
- lower and upper bounds
- polynomial approximation
- random instances
- randomly generated
- upper and lower bounds
- optimal solution
- set of randomly generated instances
- data sets
- online algorithms
- pairwise
- data structure
- neural network