Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
暂无分享,去创建一个
[1] V. Milman,et al. Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space , 1989 .
[2] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[3] K. Ball. Logarithmically concave functions and sections of convex sets in $R^{n}$ , 1988 .
[4] Jacques Stern,et al. The Two Faces of Lattices in Cryptology , 2001, CaLC.
[5] Daniele Micciancio,et al. The shortest vector in a lattice is hard to approximate to within some constant , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Matthias Köppe,et al. A Faster Algorithm for Quasi-convex Integer Polynomial Optimization , 2010, ArXiv.
[7] G. Pisier. The volume of convex bodies and Banach space geometry , 1989 .
[8] Damien Stehlé,et al. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices , 2000, ICALP.
[9] Santosh S. Vempala,et al. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[10] Vikraman Arvind,et al. Some Sieving Algorithms for Lattice Problems , 2008, FSTTCS.
[11] Daniele Micciancio,et al. Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[12] Irit Dinur,et al. Approximating SVPinfinity to within almost-polynomial factors is NP-hard , 1998, Theor. Comput. Sci..
[13] Daniele Micciancio,et al. A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations , 2013, SIAM J. Comput..
[14] Daniel Goldstein,et al. On the equidistribution of Hecke points , 2003 .
[15] András Frank,et al. An application of simultaneous approximation in combinatorial optimization , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[16] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[17] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[18] Jean Bourgain,et al. ON HIGH DIMENSIONAL MAXIMAL FUNCTIONS ASSOCIATED TO CONVEX BODIES , 1986 .
[19] V. Milman,et al. New volume ratio properties for convex symmetric bodies in ℝn , 1987 .
[20] Oded Regev,et al. Lattice problems and norm embeddings , 2006, STOC '06.
[21] Ravi Kumar,et al. Sampling short lattice vectors and the closest lattice vector problem , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[22] Nicolas Gama,et al. Rankin's Constant and Blockwise Lattice Reduction , 2006, CRYPTO.
[23] Miklós Simonovits,et al. Isoperimetric problems for convex bodies and a localization lemma , 1995, Discret. Comput. Geom..
[24] Santosh S. Vempala,et al. Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..
[25] Oded Regev,et al. Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors , 2012, Theory Comput..
[26] G. Sonnevend. Applications of analytic centers for the numerical solution of semiinfinite, convex programs arising in control theory , 1990 .
[27] Andrew Odlyzko,et al. The Rise and Fall of Knapsack Cryptosystems , 1998 .
[28] V. Milman,et al. Institute for Mathematical Physics Entropy and Asymptotic Geometry of Non{symmetric Convex Bodies Entropy and Asymptotic Geometry of Non-symmetric Convex Bodies , 2022 .
[29] Ravi Kumar,et al. A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.
[30] Antoine Joux,et al. Lattice Reduction: A Toolbox for the Cryptanalyst , 1998, Journal of Cryptology.
[31] G. C. Shephard,et al. The difference body of a convex body , 1957 .
[32] C. P. Schnorr,et al. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..
[33] 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.
[34] B. Klartag. On convex perturbations with a bounded isotropic constant , 2006 .
[35] Ravi Kannan,et al. Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..
[36] Alexander E. Litvak,et al. The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces , 1999, Math. Oper. Res..
[37] Friedrich Eisenbrand,et al. Covering cubes and the closest vector problem , 2011, SoCG '11.
[38] Greg Kuperberg,et al. From the Mahler Conjecture to Gauss Linking Integrals , 2006, math/0610904.
[39] Martin E. Dyer,et al. A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.
[40] Johannes Blömer,et al. Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima , 2007, ICALP.
[41] Subhash Khot,et al. Hardness of approximating the shortest vector problem in lattices , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[42] M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[43] W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers , 1993 .
[44] G. C. Shephard,et al. Convex Bodies Associated with a Given Convex Body , 1958 .
[45] M. Rudelson. Distances Between Non-symmetric Convex Bodies and the $$MM^* $$ -estimate , 1998, math/9812010.
[46] S. Vempala,et al. Hit-and-Run from a Corner , 2006 .
[47] Lluís Santaló,et al. Un Invariante afín para los cuerpos convexos del espacio de n dimensiones , 2009 .
[48] Nicolas Gama,et al. Finding short lattice vectors within mordell's inequality , 2008, STOC.
[49] F. Nazarov. The Hörmander Proof of the Bourgain–Milman Theorem , 2012 .
[50] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[51] Wojciech Banaszczyk,et al. Inequalities for convex bodies and polar reciprocal lattices inRn , 1995, Discret. Comput. Geom..
[52] Jin-Yi Cai,et al. Approximating the Svp to within a Factor ? , 2007 .