Pages that link to "Item:Q3547549"
From MaRDI portal
The following pages link to Improved Inapproximability of Lattice and Coding Problems With Preprocessing (Q3547549):
Displayed 5 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)