Hardness Magnification near State-Of-The-Art Lower Bounds.
Igor Carboni OliveiraJán PichRahul SanthanamPublished in: Computational Complexity Conference (2019)
Keyphrases
- lower bound
- np hard
- worst case
- upper bound
- random instances
- branch and bound algorithm
- lower and upper bounds
- upper and lower bounds
- branch and bound
- objective function
- phase transition
- computational complexity
- np hardness
- super resolution
- low resolution
- high resolution
- lower bounding
- optimal solution
- spatial resolution
- np complete
- vc dimension
- learning theory
- average case
- linear programming relaxation
- quadratic assignment problem
- constraint satisfaction
- optimal cost
- linear programming
- concept class
- agnostic learning