Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities.

Published in: STOC (2005)

Keyphrases

computational complexity
objective function
np hard
learning algorithm
matching algorithm
convex hull
semi algebraic
similarity measure
data structure
betti numbers
optimal solution
computationally efficient
segmentation algorithm
index structure