Uniform Derandomization from Pathetic Lower Bounds.
Eric AllenderVikraman ArvindFengming WangPublished in: APPROX-RANDOM (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- np hard
- branch and bound
- vc dimension
- upper and lower bounds
- optimal cost
- optimal solution
- set of randomly generated instances
- min sum
- lower bounding
- concept class
- worst case
- database systems
- randomly generated problems
- e learning
- neural network