Approximating SVPinfinity to within almost-polynomial factors is NP-hard

Abstract

We show SVP∞ and CVP∞ to be NP-hard to approximate to within n log n for some constant c¿ 0. We show a direct reduction from SAT to these problems, that combines ideas from Arora et al. (Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, p. 724) and Dinur et al. (Approximating-CVP to within almost-polynomial factors is NP-hard, manuscript, 1999… (More)
DOI: 10.1016/S0304-3975(01)00290-0

Topics

1 Figure or Table

Cite this paper

@article{Dinur2002ApproximatingST, title={Approximating SVPinfinity to within almost-polynomial factors is NP-hard}, author={Irit Dinur}, journal={Theor. Comput. Sci.}, year={2002}, volume={285}, pages={55-71} }