An elementary proof of a lower bound for the inverse of the star discrepancy.
Stefan SteinerbergerPublished in: J. Complex. (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- objective function
- school children
- worst case
- lower bounding
- upper and lower bounds
- linear programming relaxation
- np hard
- theorem proving
- optimal solution
- polynomial approximation
- sample complexity
- linear logic
- sufficiently accurate
- star shaped
- lagrangian relaxation
- competitive ratio
- constant factor
- natural deduction
- computational complexity
- search algorithm