Corrigenda: Complexity of the closest vector problem in a lattice generated by (0,1)-matrix

DOI10.1016/0020-0190(92)90011-JzbMath0785.90075OpenAlexW104800688WikidataQ127230773 ScholiaQ127230773MaRDI QIDQ1199562

Boleslaw K. Szymanski, Balaram Sinharoy

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90011-j

zbMATH Keywords

latticecorrectionclosest vector problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

This page was built for publication: Corrigenda: Complexity of the closest vector problem in a lattice generated by (0,1)-matrix