256 search results - page 10 / 52 » Recursive Lattice Reduction |
ARITH
2007
IEEE
13 years 11 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...
MST
2007
13 years 7 months ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
ACNS
2009
Springer
14 years 2 months ago
2009
Springer
ANTS
2004
Springer
14 years 28 days ago
2004
Springer
ARITH
2003
IEEE
14 years 25 days ago
2003
IEEE