Pages that link to "Item:Q4544560"
From MaRDI portal
The following pages link to The hardness of the closest vector problem with preprocessing (Q4544560):
Displayed 4 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- (Q2913823) (← links)