Login / Signup
Finding a largest empty convex subset in space is W[1]-hard
Panos Giannopoulos
Christian Knauer
Published in:
CoRR (2013)
Keyphrases
</>
low dimensional
search space
finite dimensional
database
data sets
image processing
multi agent
discrete space
databases
information retrieval
computer vision
np hard
convex hull
input space
convex optimization