Lower bounds for weak epsilon-nets and stair-convexity.
Boris BukhJirí MatousekGabriel NivaschPublished in: SCG (2009)
Keyphrases
- lower bound
- upper bound
- sample complexity
- complexity analysis
- branch and bound
- branch and bound algorithm
- np hard
- worst case
- objective function
- randomly generated problems
- optimal solution
- vc dimension
- lower and upper bounds
- upper and lower bounds
- lower bounding
- search space
- learning algorithm
- convex hull
- search algorithm
- max sat
- linear programming relaxation
- optimal cost
- weak signal