1369 search results - page 89 / 274 » Lattice computations for random numbers |
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
ISAAC
1994
Springer
14 years 1 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
BIRTHDAY
2009
Springer
14 years 3 months ago
2009
Springer
Given a family of Horn clauses, what is the minimal number of Horn clauses implying all other clauses in the family? What is the maximal number of Horn clauses from the family wit...
JUCS
2010
13 years 3 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...