The complexity of the covering radius problem
暂无分享,去创建一个
Venkatesan Guruswami | Daniele Micciancio | Oded Regev | O. Regev | V. Guruswami | Daniele Micciancio
[1] Jean-Pierre Seifert,et al. On the complexity of computing short linearly independent vectors and short bases in a lattice , 1999, STOC '99.
[2] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[3] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[4] A. McLoughlin,et al. The complexity of computing the covering radius of a code , 1984, IEEE Trans. Inf. Theory.
[5] Jean-Pierre Seifert,et al. Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors , 1999, Electron. Colloquium Comput. Complex..
[6] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[7] C. P. Schnorr,et al. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..
[8] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[9] Ravi Kumar,et al. Sampling short lattice vectors and the closest lattice vector problem , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[10] Daniele Micciancio. Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor , 2003, SIAM J. Comput..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[13] Chih-Long Lin,et al. On the longest circuit in an alterable digraph , 1995, J. Glob. Optim..
[14] Ravi Kannan,et al. Lattice translates of a polytope and the Frobenius problem , 1992, Comb..
[15] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[16] 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).
[17] W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers , 1993 .
[18] A. Litman,et al. On covering problems of codes , 1997, Theory of Computing Systems.
[19] Ravi Kumar,et al. A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.
[20] Venkatesan Guruswami,et al. The complexity of the covering radius problem on lattices and codes , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[21] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[22] Madhu Sudan,et al. Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.
[23] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[24] Subhash Khot. Hardness of Approximating the Shortest Vector Problem in Lattices , 2004, FOCS.
[25] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[26] Oded Goldreich,et al. On the Limits of Nonapproximability of Lattice Problems , 2000, J. Comput. Syst. Sci..
[27] Luca Trevisan,et al. Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.
[28] Marcus Schaefer. Completeness in the Polynomial Time Hierarchy , 2001 .
[29] Dorit Aharonov,et al. Lattice Problems in NP cap coNP , 2004, FOCS.
[30] Daniele Micciancio. The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant , 2000, SIAM J. Comput..