Publication Details
Title: Block Korkin-Zolotarev Bases and Successive Minima
Author: C. P. Schnorr
Group: ICSI Technical Reports
Date: September 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-063.pdf
Overview:
Using block Korkin–Zolotarev bases we improve Babai's construction of a nearby lattice point. Given a block Korkin–Zolotarev basis with block size beta of the lattice L and given a point x in the span of L, a lattice point v can be found in time β^{Oβ} satisfying |x-v|^2 less then or equal to m γ^{2m/{β-1}_β min_u epsilon L} |x-u|. These results also bear improvements for the method of solving integer programming problems via basis reduction.
Bibliographic Information:
ICSI Technical Report tr-92-063
Bibliographic Reference:
C. P. Schnorr. Block Korkin-Zolotarev Bases and Successive Minima. ICSI Technical Report tr-92-063, September 1992
Author: C. P. Schnorr
Group: ICSI Technical Reports
Date: September 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-063.pdf
Overview:
Using block Korkin–Zolotarev bases we improve Babai's construction of a nearby lattice point. Given a block Korkin–Zolotarev basis with block size beta of the lattice L and given a point x in the span of L, a lattice point v can be found in time β^{Oβ} satisfying |x-v|^2 less then or equal to m γ^{2m/{β-1}_β min_u epsilon L} |x-u|. These results also bear improvements for the method of solving integer programming problems via basis reduction.
Bibliographic Information:
ICSI Technical Report tr-92-063
Bibliographic Reference:
C. P. Schnorr. Block Korkin-Zolotarev Bases and Successive Minima. ICSI Technical Report tr-92-063, September 1992