Pages that link to "Item:Q2639900"
From MaRDI portal
The following pages link to Lattice points in high-dimensional spheres (Q2639900):
Displaying 29 items.
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- Minimal conditions for consistent variable selection in high dimension (Q533994) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Tight conditions for consistency of variable selection in the context of high dimensionality (Q741803) (← links)
- On the elliptic Calabi-Yau fourfold with maximal \(h^{1,1}\) (Q779310) (← links)
- Comments on the holographic description of Narain theories (Q825816) (← links)
- On the packing densities of superballs and other bodies (Q1177421) (← links)
- On the covering multiplicity of lattices (Q1193702) (← links)
- Explicit Tauberian estimates for functions with positive coefficients (Q1195419) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
- Combinatorics of the Gauss digitization under translation in 2D (Q1722618) (← links)
- On the number of ways to occupy \(n\) lattice points by balls in \(d\)-dimensional space (Q1771024) (← links)
- Some results on the asymptotic behaviour of coefficients of large powers of functions (Q1893987) (← links)
- Counting lattice points in pyramids (Q1893996) (← links)
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm (Q1934244) (← links)
- Euclidean lattices, theta invariants, and thermodynamic formalism (Q2019720) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- Low-density attack revisited (Q2384011) (← links)
- Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
- The F-theory geometry with most flux vacua (Q2636347) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)
- On the number of lattice points in a ball (Q6594638) (← links)
