274 search results - page 20 / 55 » Counting lattice vectors |
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
107
click to vote
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
103
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
DCG
1999
14 years 11 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
104
click to vote
COCO
2004
Springer
15 years 3 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...