Locally Dense Codes
暂无分享,去创建一个
[1] Jacques Stern,et al. The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[2] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[3] Shafi Goldwasser,et al. Complexity of lattice problems , 2002 .
[4] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.
[5] Daniele Micciancio. The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant , 2000, SIAM J. Comput..
[6] Daniele Micciancio,et al. Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction , 2012, Theory Comput..
[7] Subhash Khot,et al. A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem , 2014, IEEE Transactions on Information Theory.
[8] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[9] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[10] M. Sudan,et al. Hardness of approximating the minimum distance of a linear code , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[11] Oded Regev,et al. Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors , 2012, Theory Comput..
[12] Jean-Pierre Seifert,et al. Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors , 1999, Electron. Colloquium Comput. Complex..
[13] Qi Cheng,et al. A Deterministic Reduction for the Gap Minimum Distance Problem , 2012, IEEE Transactions on Information Theory.
[14] Jin-Yi Cai,et al. Approximating the Svp to within a Factor ? , 2007 .
[15] 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).
[16] Ravi Kannan,et al. Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..
[17] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[18] Jin-Yi Cai,et al. Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions , 1999, J. Comput. Syst. Sci..
[19] Oded Regev,et al. Lattice-Based Cryptography , 2006, CRYPTO.
[20] Subhash Khot,et al. Hardness of approximating the shortest vector problem in lattices , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.