共 29 条
- [1] AARONSON S, 2004, P 36 ANN ACM S THEOR, P465
- [2] A lattice problem in quantum NP [J]. 44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 210 - 219
- [3] Ajtai M., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P99, DOI 10.1145/237814.237838
- [4] Ajtai M., 1998, STOC, P10
- [5] Ajtai M., 1997, PROC 29 S THEORY COM, P284, DOI DOI 10.1145/258533.258604
- [7] BOAS PV, 1981, 8104 U AMST DEP MATH
- [9] Approximating CVP to within almost-polynomial factors is NP-hard [J]. COMBINATORICA, 2003, 23 (02) : 205 - 243
- [10] The inapproximability of lattice and coding problems with preprocessing [J]. 17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, : 44 - 52