Go to the corresponding LIPIcs Volume Portal 
Fernández V, Manuel ; Woodruff, David P. ; Yasuda, Taisuke
pdfformat: 

@InProceedings{fernndezv_et_al:LIPIcs:2019:11216, author = {Manuel Fern{\'a}ndez V and David P. Woodruff and Taisuke Yasuda}, title = {{The Query Complexity of Mastermind with l_p Distances}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {1:11:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771252}, ISSN = {18688969}, year = {2019}, volume = {145}, editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11216}, URN = {urn:nbn:de:0030drops112165}, doi = {10.4230/LIPIcs.APPROXRANDOM.2019.1}, annote = {Keywords: Mastermind, Query Complexity, l_p Distance} }
Keywords:  Mastermind, Query Complexity, l_p Distance  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)  
Issue Date:  2019  
Date of publication:  17.09.2019 