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