Faster Black-Box Algorithms Through Higher Arity Operators

12/04/2010

∙

by   Benjamin Doerr, et al.

∙

0

∙

share

We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of drops from Θ(n^2) for unary operators to O(n n). For , the Ω(n n) unary black-box complexity drops to O(n) in the binary case. For k-ary operators, k ≤ n, the -complexity further decreases to O(n/ k).