Pages that link to "Item:Q2913824"
From MaRDI portal
The following pages link to Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (Q2913824):
Displayed 10 items.
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← 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)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Voronoi Cells of Lattices with Respect to Arbitrary Norms (Q3174772) (← links)
- Inverse Optimization with Noisy Data (Q4971385) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)