A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.
Kenneth L. ClarksonPublished in: Discret. Comput. Geom. (1993)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- lower and upper bounds
- branch and bound
- vc dimension
- sample size
- branch and bound algorithm
- error probability
- search space
- simulated annealing
- sample complexity
- information retrieval
- generalization error
- data sets
- theoretical analysis
- sufficient conditions
- evolutionary algorithm
- search algorithm
- case study
- global minimum
- closed form expressions
- digital topology
- energy landscape