Pages that link to "Item:Q5188550"
From MaRDI portal
The following pages link to Inapproximability Results for Computational Problems on Lattices (Q5188550):
Displaying 11 items.
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms (Q937206) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm (Q1934244) (← links)
- On some computational problems in local fields (Q2165454) (← links)
- The complexity of some lattice problems (Q2739433) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- (Q3096713) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- (Q5875460) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)