The complexity of the covering radius problem on lattices and codes
暂无分享,去创建一个
Venkatesan Guruswami | Daniele Micciancio | Oded Regev | O. Regev | V. Guruswami | Daniele Micciancio
[1] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[2] Marcus Schaefer. Completeness in the Polynomial Time Hierarchy , 2001 .
[3] R. Guy. Review: J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups , 1989 .
[4] Dorit Aharonov,et al. Lattice problems in NP ∩ coNP , 2005, JACM.
[5] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[6] Dorit Aharonov,et al. Lattice Problems in NP cap coNP , 2004, FOCS.
[7] W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers , 1993 .
[8] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[9] Oded Goldreich,et al. On the Limits of Nonapproximability of Lattice Problems , 2000, J. Comput. Syst. Sci..
[10] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[11] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[12] C. P. Schnorr,et al. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..
[13] Ravi Kannan,et al. Lattice translates of a polytope and the Frobenius problem , 1992, Comb..
[14] Jean-Pierre Seifert,et al. Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors , 1999, Electron. Colloquium Comput. Complex..
[15] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[16] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[17] Daniele Micciancio. Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor , 2003, SIAM J. Comput..
[18] Gérard D. Cohen,et al. Covering Codes , 2005, North-Holland mathematical library.
[19] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[20] Ravi Kumar,et al. Sampling short lattice vectors and the closest lattice vector problem , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[21] Luca Trevisan,et al. Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.
[22] Chih-Long Lin,et al. On the longest circuit in an alterable digraph , 1995, J. Glob. Optim..
[23] Subhash Khot,et al. Hardness of approximating the shortest vector problem in lattices , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[24] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[25] Jean-Pierre Seifert,et al. On the complexity of computing short linearly independent vectors and short bases in a lattice , 1999, STOC '99.
[26] Guy Kindler,et al. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 2003, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[27] Ravi Kumar,et al. A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.
[28] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[29] Madhu Sudan,et al. Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.
[30] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[31] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[32] A. McLoughlin,et al. The complexity of computing the covering radius of a code , 1984, IEEE Trans. Inf. Theory.
[33] Thomas C. Hales. Sphere packings, I , 1997, Discret. Comput. Geom..