"The query complexity of a permutation-based variant of Mastermind."

Peyman Afshani et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2019.01.007

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/AfshaniADDLM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AfshaniADDLM19
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260: 28-50 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.