Pages that link to "Item:Q2848225"
From MaRDI portal
The following pages link to A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations (Q2848225):
Displaying 34 items.
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- An algebraic perspective on integer sparse recovery (Q2007643) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- Locally optimal 2-periodic sphere packings (Q2283118) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
- Subexponential class group and unit group computation in large degree number fields (Q2878849) (← links)
- Voronoi Cells of Lattices with Respect to Arbitrary Norms (Q3174772) (← links)
- The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
- Применение теории решеток к анализу схем цифровой подписи (Q3382039) (← links)
- Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) (← links)
- (Q5091027) (← links)
- A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
- A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values (Q5249301) (← links)
- On the Bit Security of Elliptic Curve Diffie–Hellman (Q5738794) (← links)
- Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family (Q5859674) (← links)
- Generalizing CGAL Periodic Delaunay Triangulations (Q5874547) (← links)
- On compact representations of Voronoi cells of lattices (Q5918916) (← links)
- Lifts for Voronoi cells of lattices (Q6050227) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Faster integer multiplication using short lattice vectors (Q6165872) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- On fluxes in the \(1^9\) Landau-Ginzburg model (Q6183498) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
- Attacking (EC)DSA with partially known multiples of nonces (Q6647745) (← links)
