The Query Complexity of a Permutation-based Variant of Mastermind

Afshani, Peyman; Agrawal, Manindra; Doerr, Benjamin; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt

doi:10.1016/j.dam.2019.01.007

Local TagsRelease HistoryDetailsSummary

The Query Complexity of a Permutation-based Variant of Mastermind

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0002-FE83-C Version Permalink: https://hdl.handle.net/21.11116/0000-0003-9AC7-F

Genre: Journal Article

Latex : The query complexity of a permutation-based variant of {M}astermind

Files

show Files

Locators

show

Creators

show

hide

Creators:
Afshani, Peyman¹, Author
Agrawal, Manindra¹, Author
Doerr, Benjamin¹, Author
Doerr, Carola¹, Author
Larsen, Kasper Green¹, Author
Mehlhorn, Kurt², Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2019Published Online: 2019Date issued: 2019

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.dam.2019.01.007
BibTex Citekey: AFSHANI2019

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Discrete Applied Mathematics

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : North-Holland

Pages: - Volume / Issue: 260 Sequence Number: - Start / End Page: 28 - 50 Identifier: ISSN: 0166-218X
CoNE: https://pure.mpg.de/cone/journals/resource/954925482629