Pages that link to "Item:Q2073315"
From MaRDI portal
The following pages link to Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315):
Displaying 5 items.
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
- Bounds for the static permutation mastermind game (Q2222951) (← links)
- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055) (← links)
- Optimal strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)