Inapproximability Results for Computational Problems on Lattices
From MaRDI portal
Recommendations
- On the limits of nonapproximability of lattice problems
- scientific article; zbMATH DE number 1775382
- Complexity of lattice problems. Non-approximability and limits of non-approximability
- Lattice problems in NP ∩ coNP
- scientific article; zbMATH DE number 1643917
- The inapproximability of lattice and coding problems with preprocessing
- Hardness of approximating the shortest vector problem in lattices
- Some optimal inapproximability results
- scientific article; zbMATH DE number 1559516
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
Cited in
(12)- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
- On some computational problems in local fields
- scientific article; zbMATH DE number 1643917 (Why is no real title available?)
- Algorithms for the shortest and closest lattice vector problems
- scientific article; zbMATH DE number 5971212 (Why is no real title available?)
- The reductions for the approximating covering radius problem
- Lattice problems in NP ∩ coNP
- Hermite’s Constant and Lattice Algorithms
- scientific article; zbMATH DE number 7650076 (Why is no real title available?)
- Improvements in the analysis of Kannan's CVP algorithm
- Approximating closest vector problem in \(\ell_\infty\) norm revisited
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
This page was built for publication: Inapproximability Results for Computational Problems on Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188550)
