85 citations · 897 across the 89 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
Playing Mastermind With Constant-Size Memory
Benjamin Doerr, Carola Winzen
We analyze the classic board game of Mastermind with holes and a constant number of colors. A result of Chvátal (Combinatorica 3 (1983), 325-329) states that the codebreaker ca…
cs.NE2011
Black-Box Complexities of Combinatorial Problems
Benjamin Doerr, Timo Kötzing, Johannes Lengler +1
Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means t…