Login / Signup

On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes.

Hans Raj Tiwary
Published in: Discret. Comput. Geom. (2008)
Keyphrases
  • minkowski sum
  • convex polyhedra
  • convex hull
  • information theoretic
  • decision trees
  • computational complexity
  • worst case
  • data sets
  • neural network
  • lower bound
  • image quality
  • learning theory