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

Theoretical Computer Science

Volumn 478, Issue , 2013, Pages 127-131

  Chen, Wenbin ^a,b,c   Peng, Lingxi ^a   Wang, Jianxiong ^a   Li, Fufang ^a   Tang, Maobin ^a   Xiong, Wei ^a   Wang, Songtao ^d  

^a GUANGZHOU UNIVERSITY   (China)

^b FUDAN UNIVERSITY   (China)

^c NANJING UNIVERSITY   (China)

^d SOUTH CHINA NORMAL UNIVERSITY   (China)

Author keywords

Computational complexity; Minimum integral solution problem; NP hardness; PCP

Indexed keywords

CLOSEST VECTOR PROBLEM WITH PREPROCESSING; INAPPROXIMABILITY; INTEGRAL SOLUTIONS; NP-HARD; NP-HARDNESS; PCP;

HARDNESS;

COMPUTATIONAL COMPLEXITY;

EID: 84875220193     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2013.01.028     Document Type: Article

References (20)

1. M. Ajtai, Generating hard instances of lattice problems, in: Proc. of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 99-108.
2. M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi, Hardness of approximating the closest vector problem with pre-processing, in: Proc. 46th IEEE Symposium on FOCS, 2005, pp. 216-225.
3. S. Arora, Probabilistic checking of proofs and the hardness of approximation problems, Ph.D. Thesis, UC Berkeley, 1994.
4. S. Arora, L. Babai, J. Stern, and E.Z. Sweedyk The hardness of approximate optima in lattices, codes, and systems of linear equations Journal of Computer and System Sciences 54 1997 317 331
5. G. Ausiello, P. Crescenzi, and M. Protasi Approximation solutions of NP-optimization problems Theoretical Computer Science 150 1995 1 55
6. M. Bellare, S. Goldwasser, C. Lund, A. Russel, Efficient Probabilistically Checkable Proofs with Applications to Approximation Problems, in: Proc. 25th ACM Symp. on Theory of Computing, 1993, pp. 294-304.
7. B. Bollobás Combinatorics 1986 Cambridge University Press
8. J. Bruck, and M. Naor The hardness of decoding linear codes with preprocessing IEEE Transactions on Information Theory 36 2 1990 381 385
9. ∞ norm IEEE Transactions on Information Theory 52 10 2006 4603 4606
10. ∞) Theoretical Computer Science 396 1-3 2008 1 9
11. ∞ to within almost-polynomial factors is NP-hard Proc. of the 4th Italian Conference on algorithms and Complexity LNCS 1767 2000 Springer
12. I. Dinur, G. Kindler, R. Raz, and S. Safra Approximating CVP to within almost-polynomial factors is NP-hard Combinatorica 23 2 2003 205 243
13. U. Feige, S. Goldwasser, L Lovász, S. Safra, and M. Szegedy Interactive proofs and the hardness of approximating cliques Journal of ACM 43 2 1996 268 292
14. U. Feige, and D. Micciancio The inapproximability of lattice and coding problems with preprocessing Journal of Computer and System Sciences 69 1 2004 45 67
15. M.R. Garey, and D.S. Johnson Computers and Intractability: a Guide to the Theory NP-Completeness 1979 W. H. Freeman and Company San Francisco
16. A. Lobstein The hardness of solving subset sum with preprocessing IEEE Transaction on Information Theory 36 4 1990 943 946
17. D. Micciancio The hardness of the closest vector problem with preprocessing IEEE Transaction on Information Theory 47 2001 1212 1215
18. D. Micciancio, and S. Goldwasser Complexity of lattice problems, A cryptographic perspective 2002 Klumer Academic Publishers
19. O. Regev Improved inapproximability of lattice and coding problem with preprocessing Proceedings of the Annual IEEE Conference on Computational Complexity vol. 18 2003 363 370
20. O. Regev, R. Rosen, Lattice problems and norm embeddings, in: Proc. of STOC, 2006.