Pages that link to "Item:Q1881262"
From MaRDI portal
The following pages link to The inapproximability of lattice and coding problems with preprocessing (Q1881262):
Displaying 11 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 hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Inapproximability results for the minimum integral solution problem with preprocessing over \(\ell_{\infty}\) norm (Q1951564) (← links)
- Approx-SVP in ideal lattices with pre-processing (Q2292889) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Inapproximability Results for Computational Problems on Lattices (Q5188550) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q5278293) (← links)
- Cyclic lattices, ideal lattices, and bounds for the smoothing parameter (Q6608567) (← links)