Pages that link to "Item:Q5756630"
From MaRDI portal
The following pages link to Rankin’s Constant and Blockwise Lattice Reduction (Q5756630):
Displaying 16 items.
- Systematics of aligned axions (Q1706848) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Sharper bounds on four lattice constants (Q2672303) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- A sieve algorithm based on overlattices (Q2878827) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Quantum Codes from High-Dimensional Manifolds (Q4638075) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- A sharper lower bound on Rankin's constant (Q6161436) (← links)
