An Upper Bound on the Number of Planar K-Sets.

János Pach William L. Steiger Endre Szemerédi

Published in: Discret. Comput. Geom. (1992)

Keyphrases

upper bound
small number
lower bound
computational complexity
maximum number
data sets
machine learning
three dimensional
np hard