5 search results - page 1 / 1 » Frobenius Problem and the Covering Radius of a Lattice |
DCG
2007
13 years 4 months ago
2007
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...