@inproceedings{0958c2885477405e894d7095970ffe48,
title = "Upper and lower bounds on unrestricted black-box complexity of jumpn,ℓ ",
abstract = "We analyse the unrestricted black-box complexity of Jumpn,ℓ functions. For upper bounds, we present three algorithms for small, medium and extreme values of ℓ We present a matrix lower bound theorem which is capable of giving better lower bounds than a general information theory approach if one is able to assign different types to queries and define relationships between them. Using this theorem, we prove lower bounds for Jump separately for odd and even values of n. For several cases, notably for extreme Jump, the first terms of lower and upper bounds coincide.",
author = "Maxim Buzdalov and Mikhail Kever and Benjamin Doerr",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015 ; Conference date: 08-04-2015 Through 10-04-2015",
year = "2015",
month = jan,
day = "1",
doi = "10.1007/978-3-319-16468-7\_18",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "209--221",
editor = "Gabriela Ochoa and Francisco Chicano",
booktitle = "Evolutionary Computation in Combinatorial Optimization - 15th European Conference, EvoCOP 2015, Proceedings",
}