# Parallel Black-Box Complexity with Tail Bounds

31 Jan 2019Per Kristian LehreDirk Sudholt

We propose a new black-box complexity model for search algorithms evaluating $\lambda$ search points in parallel. The parallel unary unbiased black-box complexity gives lower bounds on the number of function evaluations every parallel unary unbiased black-box algorithm needs to optimise a given problem... (read more)

PDF Abstract

No code implementations yet. Submit your code now