Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization.
Danny HermelinXi WuPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- branch and bound algorithm
- average case complexity
- worst case
- upper and lower bounds
- lower and upper bounds
- statistical queries
- np hard
- optimal solution
- low order
- randomly generated problems
- max sat
- lower bounding
- optimal cost
- approximation algorithms
- constant factor approximation algorithm
- quadratic assignment problem
- vc dimension
- neural network
- linear programming
- data structure
- learning algorithm