Hardness Magnification Near State-of-the-Art Lower Bounds.
Igor Carboni OliveiraJán PichRahul SanthanamPublished in: Theory Comput. (2021)
Keyphrases
- lower bound
- np hard
- worst case
- upper bound
- random instances
- branch and bound algorithm
- branch and bound
- np complete
- phase transition
- lower and upper bounds
- lower bounding
- super resolution
- optimal solution
- np hardness
- learning theory
- high resolution
- objective function
- computational complexity
- scheduling problem
- spatial resolution
- low resolution
- vc dimension
- linear programming relaxation
- quadratic assignment problem
- high resolution images
- data sets
- upper and lower bounds
- approximation algorithms
- information theoretic
- randomly generated problems
- set of randomly generated instances
- max sat
- sample complexity
- combinatorial optimization
- neural network