Pages that link to "Item:Q1608337"

The following pages link to Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337):

Displaying 8 items.

• A hardness of approximation result in metric geometry (Q785622) (← links)
• A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
• The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• Post-quantum cryptography: lattice signatures (Q2390954) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)