Pages that link to "Item:Q1274988"
From MaRDI portal
The following pages link to A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988):
Displayed 8 items.
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
- Attribute-based access control for inner product functional encryption from LWE (Q2146083) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- On the unique shortest lattice vector problem (Q5941093) (← links)