Pages that link to "Item:Q2931407"

The following pages link to Lattice problems and norm embeddings (Q2931407):

Displaying 10 items.

• Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
• An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm (Q498420) (← links)
• A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
• Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
• Complexity and approximation of finding the longest vector sum (Q1785063) (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• Post-quantum cryptography: lattice signatures (Q2390954) (← 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)