Huck Bennett

works on

approximation algorithms 1 code equivalence 1 coding theory 1 computational complexity 1 distortion measures 1 lattice analogues 1

From the 1 of 3 linked papers with an AI index.

collaborators

Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026

Hardness of the Binary Covering Radius Problem in Large $ℓ_{p}$ Norms

Huck Bennett, Peter Ly

We study the hardness of the $I^^{3}$ -approximate decisional Covering Radius Problem on lattices in the $ℓ_{p}$ norm ( $I^^{3}$ - $GapCRP_{p}$ ). Specifically, we prove that there is an…

Hardness of the Binary Covering Radius Problem in Large ℓp​ Norms

Hardness of the Binary Covering Radius Problem in Large $ℓ_{p}$ Norms