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 2 items.

• The Geometry of Lattice Cryptography (Q3092183) (← links)
• Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)