Pages that link to "Item:Q2913823"

The following pages link to Inapproximability of the shortest vector problem: toward a deterministic reduction (Q2913823):

Displaying 24 items.

• On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
• On the limits of nonapproximability of lattice problems (Q1577010) (← links)
• On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
• Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
• Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• List-decoding Barnes-Wall lattices (Q2410678) (← links)
• Improved hardness results for unique shortest vector problem (Q2629774) (← links)
• A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
• Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
• The shortest vector in a lattice is hard to approximate to within some constant (Q2719121) (← links)
• Tensor-based hardness of the shortest vector problem to within almost polynomial factors (Q2913824) (← links)
• Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
• Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
• Hardness of approximating the shortest vector problem in lattices (Q3546301) (← links)
• (Q4303886) (← links)
• Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One (Q4636451) (← 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)
• (Q5741633) (← links)
• Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
• Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems (Q6644067) (← links)
• On the SVP for low-dimensional circulant lattices (Q6645172) (← links)