Theoretical Com- puter Science561, 3–23 (Jan 2015)

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.NE · 2026-06-11 · unverdicted · novelty 7.0

The (μ+1) EA optimizes BinVal in O(μ log μ · n log n) evaluations for μ = o(n/log n), improving the prior O(μ^5 n log(n/μ^4)) bound.

Showing 1 of 1 citing paper.

Improved Runtime Bound for the $(\mu + 1)$ EA on BinVal cs.NE · 2026-06-11 · unverdicted · none · ref 8
The (μ+1) EA optimizes BinVal in O(μ log μ · n log n) evaluations for μ = o(n/log n), improving the prior O(μ^5 n log(n/μ^4)) bound.