On the complexity of lattice problems with polynominal approximation factors

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)

Original languageEnglish (US)
Title of host publicationThe LLL algorithm
EditorsP.Q. Nguyen, B. Vallee
PublisherSpringer
StatePublished - 2010

Cite this

Regev, O. (2010). On the complexity of lattice problems with polynominal approximation factors. In P. Q. Nguyen, & B. Vallee (Eds.), The LLL algorithm Springer .

On the complexity of lattice problems with polynominal approximation factors. / Regev, Oded.

The LLL algorithm. ed. / P.Q. Nguyen; B. Vallee. Springer , 2010.

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)

Regev, O 2010, On the complexity of lattice problems with polynominal approximation factors. in PQ Nguyen & B Vallee (eds), The LLL algorithm. Springer .
Regev O. On the complexity of lattice problems with polynominal approximation factors. In Nguyen PQ, Vallee B, editors, The LLL algorithm. Springer . 2010
Regev, Oded. / On the complexity of lattice problems with polynominal approximation factors. The LLL algorithm. editor / P.Q. Nguyen ; B. Vallee. Springer , 2010.
@inbook{f2a1cc82d2d2486e96717eba9f2076c8,
title = "On the complexity of lattice problems with polynominal approximation factors",
author = "Oded Regev",
year = "2010",
language = "English (US)",
editor = "P.Q. Nguyen and B. Vallee",
booktitle = "The LLL algorithm",
publisher = "Springer",

}

TY - CHAP

T1 - On the complexity of lattice problems with polynominal approximation factors

AU - Regev, Oded

PY - 2010

Y1 - 2010

M3 - Chapter (peer-reviewed)

BT - The LLL algorithm

A2 - Nguyen, P.Q.

A2 - Vallee, B.

PB - Springer

ER -