Inapproximability results for the minimum integral solution problem with preprocessing over l ∞ norm

The Minimum Integral Solution Problem with preprocessing has been introduced by Alekhnovich, Khot, Kindler, and Vishnoi [M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi, Hardness of approximating the closest vector problem with preprocessing, in: Proc. 46th IEEE Symposium on FOCS, 2005, pp. 216-225]. They studied the complexity of Minimum Integral Solution Problem with preprocessing over @?"p norm ([email protected]?p 0, unless P=NP.