Pages that link to "Item:Q1741495"
From MaRDI portal
The following pages link to The query complexity of a permutation-based variant of mastermind (Q1741495):
Displaying 11 items.
- On the algorithmic complexity of the Mastermind game with black-peg results (Q989451) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Working principles of binary differential evolution (Q2007720) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- Quantum algorithm for learning secret strings and its experimental demonstration (Q2111665) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
- The runtime of the compact genetic algorithm on jump functions (Q2240129) (← links)
- Mutation Rate Control in the $$(1+\lambda )$$ Evolutionary Algorithm with a Self-adjusting Lower Bound (Q4965121) (← links)
- (Q5875452) (← links)
- Choosing the right algorithm with hints from complexity theory (Q6178456) (← links)
- Fourier analysis meets runtime analysis: precise runtimes on plateaus (Q6586657) (← links)
