Lattice problems in N P ∩ coNP

Dorit Aharonov, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 languageEnglish (US)
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Pages362-371
Number of pages10
StatePublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: Oct 17 2004Oct 19 2004

Other

OtherProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004
CountryItaly
CityRome
Period10/17/0410/19/04

Fingerprint

Fourier transforms

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Aharonov, D., & Regev, O. (2004). Lattice problems in N P ∩ coNP. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 362-371)

Lattice problems in N P ∩ coNP. / Aharonov, Dorit; Regev, Oded.

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. p. 362-371.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aharonov, D & Regev, O 2004, Lattice problems in N P ∩ coNP. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. pp. 362-371, Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, Rome, Italy, 10/17/04.
Aharonov D, Regev O. Lattice problems in N P ∩ coNP. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. p. 362-371
Aharonov, Dorit ; Regev, Oded. / Lattice problems in N P ∩ coNP. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. pp. 362-371
@inproceedings{6bd879fd2ea84e3db0c48855fa495bcb,
title = "Lattice problems in N P ∩ coNP",
abstract = "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.",
author = "Dorit Aharonov and Oded Regev",
year = "2004",
language = "English (US)",
pages = "362--371",
booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

}

TY - GEN

T1 - Lattice problems in N P ∩ coNP

AU - Aharonov, Dorit

AU - Regev, Oded

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=17744382015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17744382015&partnerID=8YFLogxK

M3 - Conference contribution

SP - 362

EP - 371

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

ER -