Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...