Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems.
Sandeep SenPublished in: FSTTCS (1994)
Keyphrases
- related problems
- convex hull
- lower bound
- decision trees
- worst case
- upper bound
- broadly applicable
- computational geometry
- hyperplane
- closest points
- objective function
- stable marriage
- machine learning
- range searching
- data sets
- extreme points
- average case complexity
- point sets
- training samples
- data points
- np hard
- training set
- optimal solution