Superpolynomial Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs.
Pravesh KothariPeter ManoharPublished in: Electron. Colloquium Comput. Complex. (2024)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- upper and lower bounds
- branch and bound algorithm
- branch and bound
- vc dimension
- np hard
- objective function
- worst case
- optimal solution
- optimal cost
- randomized algorithms
- high quality
- lower bounding
- constant factor
- quadratic assignment problem
- scheduling problem
- smooth regions
- upper bounding