no code implementations • 2 May 2024 • Benjamin Doerr, Martin S. Krejca, Noé Weeks
For standard bit mutation, we prove an expected runtime of $O(n N \log n + n^{n/(2N)} N \log n)$ function evaluations.
