Sparse Selfreducible Sets and Nonuniform Lower Bounds.
Harry BuhrmanLeen TorenvlietFalk UngerNikolai K. VereshchaginPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- compressive sensing
- vc dimension
- np hard
- branch and bound algorithm
- sparse representation
- sparse data
- high dimensional
- randomly generated problems
- scheduling problem
- linear combination
- data sets
- random projections
- lower and upper bounds
- upper and lower bounds
- linear programming relaxation