English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

The Query Complexity of a Permutation-based Variant of Mastermind

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K. G., & Mehlhorn, K. (2019). The Query Complexity of a Permutation-based Variant of Mastermind. Discrete Applied Mathematics, 260, 28-50. doi:10.1016/j.dam.2019.01.007.


Cite as: http://hdl.handle.net/21.11116/0000-0002-FE83-C
Abstract
There is no abstract available