4 Algorithms presented in this paper assume that D is unrestricted, therefore we cannot afford to build any convex hull explicitly.
we turn to linear programming (LP), for which we know algorithms (Karmarkar, 1984) that are polynomial in the number of dimensions and linear in the number of points, i.e., O(N T ), where T = D 3.5 .