Lattice problems in N P ∩ coNP

Dorit Aharonov*, Oded Regev

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

29 Scopus citations


We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of √n lie in NP intersect coNP. The result (almost) subsumes the three mutually-incomparable previous results regarding these lattice problems: Banaszczyk, Goldreich and Goldwasser, and Aharonov and Regev. Our technique is based on a simple fact regarding succinct approximation of functions using their Fourier transform over the lattice. This technique might be useful elsewhere - we demonstrate this by giving a simple and efficient algorithm for one other lattice problem (CVPP) improving on a previous result of Regev. An interesting fact is that our result emerged from a "dequantization" of our previous quantum result in. This route to proving purely classical results might be beneficial elsewhere.

Original languageAmerican English
Pages (from-to)362-371
Number of pages10
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
StatePublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: 17 Oct 200419 Oct 2004


Dive into the research topics of 'Lattice problems in N P ∩ coNP'. Together they form a unique fingerprint.

Cite this