Pages that link to "Item:Q2490259"

The following pages link to Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259):

Displaying 12 items.

• An improved lower bound for approximating shortest integer relation in \(\ell _{\infty }\) norm \((SIR_{\infty })\) (Q845926) (← links)
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms (Q937206) (← links)
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
• Tensor-based hardness of the shortest vector problem to within almost polynomial factors (Q2913824) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
• Hardness of approximating the shortest vector problem in lattices (Q3546301) (← links)
• (Q4303886) (← links)
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
• Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
• (Q5121902) (← links)
• On module unique-SVP and NTRU (Q6135456) (← links)