Approximating closest vector problem in \(\ell_\infty\) norm revisited

DOI10.1007/978-3-030-27195-4_4OpenAlexW2964581406MaRDI QIDQ6198999

Wenbin Chen, Jian'er Chen

Publication date: 23 February 2024

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-27195-4_4

zbMATH Keywords

computational complexityNP-hardnessprobabilistically checkable proofsclosest vector problemmin total label cover problem

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Approximating closest vector problem in \(\ell_\infty\) norm revisited