425 search results - page 31 / 85 » Polynomial Factorization 1987-1991 |
CORR
2012
Springer
12 years 6 months ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
COCO
2004
Springer
14 years 2 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...
ICIP
1998
IEEE
15 years 14 days ago
1998
IEEE
A method has beenproposed for blindly estimating the Point Spread Function (PSF) of video data. The PSF's of the images in a sequence are assumed to be of compact support and...
ECCC
2007
13 years 11 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
JAT
2010
13 years 9 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...