Lower bounds for weak epsilon-nets and stair-convexity.
Boris BukhJirí MatousekGabriel NivaschPublished in: CoRR (2008)
Keyphrases
- lower bound
- upper bound
- complexity analysis
- sample complexity
- branch and bound algorithm
- optimal solution
- objective function
- np hard
- worst case
- branch and bound
- lower and upper bounds
- vc dimension
- upper and lower bounds
- convex hull
- quadratic assignment problem
- optimal cost
- randomly generated problems
- sample size
- learning theory
- critical points
- search space
- social networks
- concept class