An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over ℓ∞ norm

Journal of Combinatorial Optimization

Volumn 30, Issue 3, 2015, Pages 447-455

  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

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY;

APPROXIMATION COMPLEXITY; INTEGRAL SOLUTIONS; LOWER BOUNDS; NP-HARD; NP-HARDNESS; PCP;

HARDNESS;

EID: 84940722054     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-013-9646-4     Document Type: Article

References (20)

1. Ajtai M (1996) Generating hard instances of lattice problems. In: Proceedings of the 28th annual ACM symposium on theory of computing, pp 99–108
2. Alekhnovich M, Khot S, Kindler G, Vishnoi N (2005) Hardness of approximating the closest vector problem with pre-processing. In: Proceedings of the 46th IEEE symposium on FOCS, pp 216–225
3. Arora S (1994) Probabilistic checking of proofs and the hardness of approximation problems. PhD Thesis, UC Berkeley
4. Arora S, Babai L, Stern J, Sweedyk EZ (1997) The hardness of approximate optima in lattices, codes, and systems of linear equations. J Comput Syst Sci 54(2):317–331
5. Ausiello G, Crescenzi P, Protasi M (1995) Approximation solutions of NP-optimization problems. Theor Comput Sci 150:1–55
6. Bellare M, Goldwasser S, Lund C, Russel A (1993) Efficient probabilistically checkable proofs with applications to approximation problems. In: Proceedings of the 25th ACM symposium on theory of computing, pp 294–304
7. Bollobás B (1986) Combinatorics. Cambridge University Press, Cambridge
8. Bruck J, Naor M (1990) The hardness of decoding linear codes with preprocessing. IEEE Trans Inf Theory 36(2):381–385
9. Chen W, Peng L, Wang J, Li F, Tang M, Xiong W, Wang S (2013) In approximability results for the minimum integral solution problem with preprocessing over infinity norm. Theor Comput Sci 478:127–131
10. Chen WB, Meng JT (2006) The hardness of the closest vector problem with preprocessing over ℓ∞ norm. IEEE Trans Inf Theory 52(10):4603–4606
11. Chen W, Meng J, Yin D (2008) An improved lower bound for approximating minimum GCD multiplier in ℓ∞ norm (GCDM$$_\infty $$∞). Theor Comput Sci 396(1–3):1–9
12. Dinur I (2000) Approximating SVP$$_\infty $$∞ to within almost-polynomial factors is NP-hard. In: Proceedings of the 4th Italian conference on algorithms and complexity. LNCS, vol 1767. Springer, Berlin
13. Dinur I, Kindler G, Raz R, Safra S (2003) Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica 23(2):205–243
14. Feige U, Micciancio D (2004) The inapproximability of lattice and coding problems with preprocessing. J Comput Syst Sci 69(1):45–67
15. Feige U, Goldwasser S, Lovász L, Safra S, Szegedy M (1996) Interactive proofs and the hardness of approximating cliques. J ACM 43(2):268–292
16. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory NP-completeness. W. H. Freeman and Company, San Francisco
17. Lobstein A (1990) The hardness of solving subset sum with preprocessing. IEEE Trans Inf Theory 36(4):943–946
18. Micciancio D (2001) The hardness of the closest vector problem with preprocessing. IEEE Trans Inf Theory 47:1212–1215
19. Regev O (2003) Improved inapproximability of lattice and coding problem with preprocessing. Proc Annu IEEE Conf Comput Complex 18:363–370
20. Regev O, Rosen R (2006) Lattice problems and norm embeddings. In: Proceedings of STOC