Lattice problems in NP ∩ coNP

@article{Aharonov2005LatticePI,
  title={Lattice problems in NP ∩ coNP},
  author={D. Aharonov and O. Regev},
  journal={J. ACM},
  year={2005},
  volume={52},
  pages={749-765}
}
We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of &nradic; lie in NP intersect coNP. The result (almost) subsumes the three mutually-incomparable previous results regarding these lattice problems: Banaszczyk [1993], Goldreich and Goldwasser [2000], and Aharonov and Regev [2003]. Our technique is based on a simple fact regarding succinct approximation of functions using their Fourier series over the lattice. This technique might be… Expand
155 Citations

Paper Mentions

Blog Post
Limits on the Hardness of Lattice Problems in ell _p Norms
  • Chris Peikert
  • Mathematics, Computer Science
  • Computational Complexity Conference
  • 2007
  • 32
  • Highly Influenced
Limits on the Hardness of Lattice Problems in ℓp Norms
  • Chris Peikert
  • Mathematics, Computer Science
  • Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
  • 2007
  • 83
  • Highly Influenced
  • PDF
Lattices that admit logarithmic worst-case to average-case connection factors
  • 71
  • PDF
Modular Form Approach to Solving Lattice Problems
Local Testing for Membership in Lattices
  • 1
  • PDF
Sieving for Closest Lattice Vectors (with Preprocessing)
  • 13
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Improved inapproximability of lattice and coding problems with preprocessing
  • O. Regev
  • Mathematics
  • 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
  • 2003
  • 23
  • Highly Influential
New bounds in some transference theorems in the geometry of numbers
  • 372
  • Highly Influential
  • PDF