Pages that link to "Item:Q2051858"
From MaRDI portal
The following pages link to Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858):
Displaying 7 items.
- A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors (Q1606967) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Closest periodic vectors in \(L_p\) spaces (Q2446104) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Economical convex coverings and applications (Q6583674) (← links)