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 7 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420) (← links)
- A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- (Q2913823) (← links)