425 search results - page 18 / 85 » Polynomial Factorization 1987-1991 |
JCO
2010
13 years 5 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
EUROCRYPT
2004
Springer
14 years 24 days ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...