Testing membership in the { 0 , 1 / 2 }-closure is strongly NP-hard , even for polytopes contained in the n-dimensional 0 / 1-cube