Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes.
Eran NevoPublished in: Discret. Comput. Geom. (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- optimal solution
- point correspondences
- objective function
- lower and upper bounds
- worst case
- lower bounding
- competitive ratio
- von neumann
- sufficiently accurate
- upper and lower bounds
- neural network
- linear programming relaxation
- vc dimension
- special case
- data sets