55 search results - page 1 / 11 » Lattice problems and norm embeddings |
STOC
2006
ACM
14 years 11 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
CC
2008
Springer
13 years 11 months ago
2008
Springer
JCSS
2007
13 years 10 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
ARITH
2007
IEEE
14 years 2 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...