50 search results - page 9 / 10 » Random knapsack in expected polynomial time |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
WEA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
ISAAC
2004
Springer
14 years 3 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...