Pages that link to "Item:Q3005588"

The following pages link to Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588):

Displaying 21 items.

• Correcting noisy exponentiation black-boxes modulo a prime (Q396612) (← links)
• Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
• Dynamic trading under integer constraints (Q1788825) (← links)
• List decoding of number field codes (Q2249795) (← links)
• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
• On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
• Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
• Efficient computation of multidimensional theta functions (Q2422388) (← links)
• On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
• Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
• Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
• Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
• (Q5076475) (← links)
• On the density of cyclotomic lattices constructed from codes (Q5269116) (← links)
• A Note on Lattice Packings via Lattice Refinements (Q5374123) (← links)
• On compact representations of Voronoi cells of lattices (Q5918916) (← links)
• Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight (Q6043377) (← links)
• Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
• Attacking (EC)DSA scheme with ephemeral keys sharing specific bits (Q6499547) (← links)