Pages that link to "Item:Q3768415"
From MaRDI portal
The following pages link to On the number of queries necessary to identify a permutation (Q3768415):
Displaying 14 items.
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← links)
- Bounds for the static permutation mastermind game (Q2222951) (← links)
- Unshuffling permutations: trivial bijections and compositions (Q2327475) (← links)
- The worst case number of questions in generalized AB game with and without white-peg answers (Q2341748) (← links)
- Strategy optimization for deductive games (Q2371368) (← links)
- Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
- Permutation Property Testing under Different Metrics with Low Query Complexity (Q4575850) (← links)
- Optimal strategies for the static black-peg AB game with two and three pegs (Q6637050) (← links)
