417 search results - page 46 / 84 » Running Time Predictions for Factoring Algorithms |
121
click to vote
COMGEO
2002
ACM
14 years 9 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
CEC
2010
IEEE
14 years 7 months ago
2010
IEEE
In this work we examined the performance of two evolutionary algorithms, a genetic algorithm (GA) and particle swarm optimization (PSO), in the estimation of the parameters of a mo...
ASIACRYPT
2003
Springer
15 years 3 months ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...
147
click to vote
CANS
2011
Springer
13 years 9 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
CPM
2010
Springer
15 years 2 months ago
2010
Springer
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...