Pages that link to "Item:Q2870055"
From MaRDI portal
The following pages link to Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055):
Displaying 9 items.
- Extending permutation arrays: improving MOLS bounds (Q521869) (← links)
- On the query complexity of black-peg AB-mastermind (Q1651863) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- Solving static permutation mastermind using \(O(n \log n)\) queries (Q2073315) (← links)
- The exact query complexity of yes-no permutation mastermind (Q2221264) (← 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)
- Solving a permutation problem by a fully polynomial-time approximation scheme (Q3000079) (← links)
- Permutation Property Testing under Different Metrics with Low Query Complexity (Q4575850) (← links)
