The complexity of the covering radius problem

Computational Complexity

Volumn 14, Issue 2, 2005, Pages 90-121

  Guruswami, Venkatesan ^a   Micciancio, Daniele ^b   Regev, Oded ^c  

^a University of Washington   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approxiamation algorithms; Complexity classes; Covering radius; Hardness of approximation; Interactive proofs; Lattices; Linear codes; Polynomial time hierachy

Indexed keywords

EID: 21244481660     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0193-y     Document Type: Conference Paper

References (40)

1. D. AHARONOV & O. REGEV (2004). Lattice problems in NP intersect coNP. In Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS).
2. 2 is NP-hard for randomized reductions (extended abstract). In Proc. 30th Annual ACM Symposium on Theory of Computing-STOC '98 (Dallas, TX), ACM, 10-19.
3. M. AJTAI, R. KUMAR & D. SIVAKUMAR (2001). A sieve algorithm for the shortest lattice vector problem. In Proc. 33rd Annual ACM Symposium on Theory of Computing-STOC 2001 (Heraklion), ACM, 601-610.
4. M. AJTAI, R. KUMAR & D. SIVAKUMAR (2002). Sampling short lattice vectors and the closest lattice vector problem. In Proc. 17th IEEE Annual Conference on Computational Complexity-CCC '02 (Montreal), IEEE, 53-57.
5. S. ARORA & C. LUND (1996). Hardness of approximation. In Approximation Algorithms for NP-hard Problems, D. S. Hochbaum (ed.), PWS, Boston.
6. L. BABAI (1986). On Lovász' lattice reduction and the nearest lattice point problem. Combinatorics 6, 1-13.
7. W. BANASZCZYK (1993). New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625-635.
8. J. BLÖMER & J.-P. SEIFERT (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. In Proc. 31st Annual ACM Symposium on Theory of Computing-STOC '99 (Atlanta, GA), ACM, 711-720.
9. R. BOPPANA, J. HÅSTAD & S. ZACHOS (1987). Does co-NP have short interactive proofs? Inform. Process. Lett. 25, 127-132.
10. G. COHEN, I. HONKALA, S. LITSYN & A. LOBSTEIN (1997). Covering Codes. North-Holland Math. Library 54, North-Holland, Amsterdam.
11. J. CONWAY & N. J. A. SLOANE (1998). Sphere Packings, Lattices and Groups. 3rd ed., Springer.
12. ∞ to within almost-polynomial factors is NP-hard. In Proc. 4th Italian Conference on Algorithms and Complexity - CIAC 2000 (Rome), G. Bongiovanni, G. Gambosi & R. Petreschi (eds.), Lecture Notes in Comput. Sci. 1767, Springer, 263-276.
13. I. DINUR, G. KINDLER, R. RAZ & S. SAFRA (2003). Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica 23, 205-243.
14. Preliminary version in FOCS 1998.
15. I. DUMER, D. MICCIANCIO & M. SUDAN (2003). Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inform. Theory 49, 22-37.
16. Preliminary version in FOCS 1999.
17. P. VAN EMDE BOAS (1981). Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report 8104, Mathematische Instituut, Univ. Amsterdam. Available on-line at URL http://turing.wins.uva.nl/~peter/.
18. U. FEIGE (1998). A threshold of In n for approximating set cover. J. ACM 45, 634-652.
19. M. FRANCES & A. LITMAN (1997). On covering problems of codes. Theory Comput. Systems 30, 113-119.
20. M. GAREY & D. JOHNSON (1979). Computers and Intractability. A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco.
21. O. GOLDREICH & S. GOLDWASSER (2000). On the limits of nonapproximability of lattice problems. J. Comput. System Sci. 60, 540-563.
22. Preliminary version in STOC'98.
23. O. GOLDREICH, D. MICCIANCIO, S. SAFRA & J. SEIFERT (1999). Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inform. Process. Lett. 71, 55-61.
24. R. KANNAN (1992). Lattice translates of a polytope and the Frobenius problem. Combinatorics 12, 161-177.
25. S. KHOT (2004). Hardness of approximating the shortest vector problem in lattices. In Proc. 45rd Annual Symposium on Foundations of Computer Science - FOCS 2004 (Rome), IEEE, 126-135.
26. K.-I Ko & C.-L. LIN (1995). On the longest circuit in an alterable digraph. J. Global Optim. 7, 279-295.
27. C. LUND & M. YANNAKAKIS (1994). On the hardness of approximating minimization problems. J. ACM 41, 960-981.
28. V. LYUBASHEVSKY (2004). A note on the tightness of a lemma of Guruswami, Micciancio and Regev. Private communication.
29. A. MCLOUGHLIN (1984). The complexity of computing the covering radius of a code. IEEE Trans. Inform. Theory 30, 800-804.
30. D. MICCIANCIO (2001). The shortest vector problem is NP-hard to approximate to within some constant. SIAM J. Comput. 30, 2008-2035.
31. Preliminary version in FOCS 1998.
32. D. MICCIANCIO (2004). Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor. SIAM J. Comput. 34, 118-169.
33. Preliminary version in STOC 2002.
34. D. MICCIANCIO & S. GOLDWASSER (2002). Complexity of Lattice Problems: A Cryptographic Perspective. Kluwer Internat. Ser Engrg. Comput. Sci. 671, Kluwer, Boston.
35. R. RAZ (1998). A parallel repetition theorem. SIAM J. Comput. 27, 763-803.
36. M. SCHAEFER & C. UMANS (2002a). Completeness in the polynomial-time hierarchy: a compendium. SIGACT News.
37. M. SCHAEFER & C. UMANS (2002b). Completeness in the polynomial-time hierarchy: part II. SIGACT News.
38. C. SCHNORR (1987). A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53, 201-224.
39. L. J. STOCKMEYER (1977). The polynomial-time hierarchy. Theoret. Comput. Sci. 3, 1-22.
40. L. TREVISAN (2001). Non-approximability results for optimization problems on bounded degree instances. In Proc. 33rd Annual ACM Symposium on Theory of Computing-STOC 2001 (Heraklion), ACM, 453-461.