1449 search results - page 258 / 290 » Self-Randomized Exponentiation Algorithms |
113
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
120
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
115
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
153
click to vote
CPM
2009
Springer
15 years 9 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
109
click to vote
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
Moore’s Law suggests that the number of processing cores on a single chip increases exponentially. The future performance increases will be mainly extracted from thread-level par...