A New Lower Bound Theorem for Combinatorial 2k-Manifolds.
Eric SparlaPublished in: Graphs Comb. (1999)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- objective function
- manifold learning
- optimal solution
- lower bounding
- low dimensional
- lower and upper bounds
- upper and lower bounds
- polynomial approximation
- cell complexes
- sample complexity
- high dimensional data
- constant factor
- euclidean space
- linear programming relaxation
- concept class
- arbitrary dimension
- digital topology
- worst case
- data points