Explicit lower bounds via geometric complexity theory.

Peter Bürgisser Christian Ikenmeyer

Published in: STOC (2013)

Keyphrases

complexity theory
lower bound
computational geometry
upper bound
theoretical basis
branch and bound
computer graphics
branch and bound algorithm
convex hull
vc dimension
multiscale
objective function
np hard
lower and upper bounds
computer vision
geometric structure