Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time

Published in: CoRR (2006)

Keyphrases

semi algebraic
betti numbers
spatial databases
arbitrary dimension
computational complexity
sufficient conditions
objective function
path planning
planar graphs