Pages that link to "Item:Q757465"

The following pages link to Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465):

Displaying 45 items.

• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
• More on average case vs approximation complexity (Q430823) (← links)
• Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
• A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• Lamination and antilamination of Euclidean lattices (Q988064) (← links)
• A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500) (← links)
• Dual vectors and lower bounds for the nearest lattice point problem (Q1107568) (← links)
• Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) (← links)
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
• Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
• Lattice inequalities for convex bodies and arbitrary lattices (Q1314869) (← links)
• New bounds in some transference theorems in the geometry of numbers (Q1318081) (← links)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
• Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\) (Q1346139) (← links)
• Successive minima, intrinsic volumes, and lattice determinants (Q1346140) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• On the limits of nonapproximability of lattice problems (Q1577010) (← links)
• A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
• Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
• On the number of integer points in a multidimensional domain (Q1741471) (← links)
• A lattice-based public-key cryptosystem (Q1854277) (← links)
• A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
• The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
• Generalized degree and optimal Loewner-type inequalities (Q1885657) (← links)
• Covering sets for plane lattices (Q1915338) (← links)
• Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
• Euclidean lattices, theta invariants, and thermodynamic formalism (Q2019720) (← links)
• Counting ideals in ray classes (Q2109396) (← links)
• Towards faster polynomial-time lattice reduction (Q2128584) (← links)
• A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) (← links)
• An upper bound on the number of perfect quadratic forms (Q2308288) (← links)
• Discrete analogues of John's theorem (Q2332797) (← links)
• Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
• Reduction of Smith normal form transformation matrices (Q2487958) (← links)
• Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
• Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
• Hermitian vector bundles and extension groups on arithmetic schemes. I: Geometry of numbers (Q2655797) (← links)
• Sharper bounds on four lattice constants (Q2672303) (← links)
• Multidimensional Extremal Logan’s and Bohman’s Problems (Q2813535) (← links)
• SLIDE REDUCTION, SUCCESSIVE MINIMA AND SEVERAL APPLICATIONS (Q2872006) (← links)
• Approximating the densest sublattice from Rankin’s inequality (Q2878829) (← links)
• La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász (Q3033847) (← links)
• On successive minima and intrinsic volumes (Q3139951) (← links)
• Hyperelliptic surfaces are Loewner (Q3372097) (← links)