Nearest lattice point algorithms on semi \(k\)-reduced basis

zbMATH Open1161.68493MaRDI QIDQ866044

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

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

Related Items (1)

Unnamed Item

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• On Lovász' lattice reduction and the nearest lattice point problem 👍 👎
• Dual vectors and lower bounds for the nearest lattice point problem 👍 👎
• An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$ 👍 👎
• Closest point search in lattices 👍 👎
• Linear-Time Nearest Point Algorithms for Coxeter Lattices 👍 👎
• Lattice Sparsification and the Approximate Closest Vector Problem 👍 👎

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