3208 search results - page 504 / 642 » A Lower Bound for Primality |
155
click to vote
COCO
2005
Springer
16 years 1 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
152
click to vote
ECAL
2005
Springer
16 years 1 days ago
2005
Springer
Efficient hierarchical architectures for reconfigurable and adaptive multi-agent networks require dynamic cluster formation among the set of nodes (agents). In the absence of cen...
178
click to vote
FCT
2005
Springer
16 years 20 hour ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
154
click to vote
GECCO
2005
Springer
16 years 17 hour ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
168
click to vote
IMA
2005
Springer
16 years 4 hour ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...