Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard

@inproceedings{Dinur1999ApproximatingST,
  title={Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard},
  author={Irit Dinur},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={1999}
}

From This Paper

Topics from this paper.
11 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

Similar Papers

Loading similar papers…