Hardness magnification near state-of-the-art lower bounds.
Igor Carboni OliveiraJán PichRahul SanthanamPublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- lower bound
- np hard
- worst case
- upper bound
- random instances
- branch and bound
- branch and bound algorithm
- objective function
- super resolution
- upper and lower bounds
- optimal solution
- computational complexity
- phase transition
- high resolution
- lower bounding
- spatial resolution
- lower and upper bounds
- np hardness
- low resolution
- learning theory
- quadratic assignment problem
- approximation algorithms
- vc dimension
- np complete
- data structure
- agnostic learning
- image processing
- online algorithms
- linear programming relaxation
- high quality
- image sequences