Nearest lattice point algorithms on semi k-reduced basis

MaRDI QIDQ866044zbMATH OpenFDO

Authors Haibin Kan, Hong Shen

Publication date 20 February 2007

Published in Science in China. Series F (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1504656
• Dual vectors and lower bounds for the nearest lattice point problem
• Closest point search in lattices
• Linear-Time Nearest Point Algorithms for Coxeter Lattices
• On Lovász' lattice reduction and the nearest lattice point problem
• scientific article; zbMATH DE number 3908520
• An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
• Lattice sparsification and the approximate closest vector problem
• scientific article; zbMATH DE number 6607548
• Publication:4938470

Cited in

(1)

• scientific article; zbMATH DE number 1504656 (Why is no real title available?)

This page was built for publication: Nearest lattice point algorithms on semi \(k\)-reduced basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866044)