The Query Complexity of Mastermind with $\ell_p$ Distances (Q6325851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Query Complexity of Mastermind with $\ell_p$ Distances |
scientific article; zbMATH DE number 7650068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Query Complexity of Mastermind with $\ell_p$ Distances |
scientific article; zbMATH DE number 7650068 |
Statements
23 September 2019
0 references
cs.DS
0 references
cs.DM
0 references
math.CO
0 references
