Sharp lower bounds on the extractable randomness from non-uniform sources.
Boris SkoricChibuzo ObiEvgeny A. VerbitskiyBerry SchoenmakersPublished in: Inf. Comput. (2011)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- information sources
- branch and bound algorithm
- lower and upper bounds
- np hard
- worst case
- multiple sources
- lower bounding
- optimal solution
- optimal cost
- data sources
- quadratic assignment problem
- upper and lower bounds
- linear programming
- databases
- min sum
- linear programming relaxation
- search algorithm
- high quality