Pages that link to "Item:Q1014636"
From MaRDI portal
The following pages link to Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636):
Displaying 20 items.
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
- Voronoi Cells of Lattices with Respect to Arbitrary Norms (Q3174772) (← links)
- The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
- (Q5091027) (← links)
- (Q5741633) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Quantum blockchain-enabled exchange protocol model for decentralized systems (Q6139235) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- \textsf{FuLeeca}: a Lee-based signature scheme (Q6550578) (← links)
- Economical convex coverings and applications (Q6583674) (← links)