A Note on Lower Bounds for Colourful Simplicial Depth.
Antoine DezaTamon StephenFeng XiePublished in: Symmetry (2013)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- np hard
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- upper and lower bounds
- depth information
- quadratic assignment problem
- worst case
- optimal cost
- randomly generated problems
- data structure
- neural network
- vc dimension
- average case
- betti numbers