Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1812.08480
Cited By
The Query Complexity of a Permutation-Based Variant of Mastermind
20 December 2018
P. Afshani
Manindra Agrawal
Benjamin Doerr
Carola Doerr
Kasper Green Larsen
K. Mehlhorn
LRM
Re-assign community
ArXiv
PDF
HTML
Papers citing
"The Query Complexity of a Permutation-Based Variant of Mastermind"
4 / 4 papers shown
Title
Complexity Theory for Discrete Black-Box Optimization Heuristics
Carola Doerr
18
28
0
06 Jan 2018
The (1+1) Elitist Black-Box Complexity of LeadingOnes
Carola Doerr
Johannes Lengler
18
13
0
08 Apr 2016
Black-Box Complexity: Breaking the
O
(
n
log
n
)
O(n \log n)
O
(
n
lo
g
n
)
Barrier of LeadingOnes
Benjamin Doerr
Carola Doerr
48
16
0
24 Oct 2012
Faster Black-Box Algorithms Through Higher Arity Operators
Benjamin Doerr
Daniel Johannsen
Timo Kotzing
Per Kristian Lehre
Markus Wagner
Carola Doerr
53
65
0
04 Dec 2010
1