The Query Complexity of Mastermind with lp Distances.
M. Fernandez, D. Woodruff, and T. Yasuda. APPROX-RANDOM, volume 145 of LIPIcs, page 1:1-1:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/approx/FernandezW019
%A Fernandez, Manuel
%A Woodruff, David P.
%A Yasuda, Taisuke
%B APPROX-RANDOM
%D 2019
%E Achlioptas, Dimitris
%E Végh, László A.
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 1:1-1:11
%T The Query Complexity of Mastermind with lp Distances.
%U http://dblp.uni-trier.de/db/conf/approx/approx2019.html#FernandezW019
%V 145
%@ 978-3-95977-125-2
@inproceedings{conf/approx/FernandezW019,
added-at = {2019-10-19T00:00:00.000+0200},
author = {Fernandez, Manuel and Woodruff, David P. and Yasuda, Taisuke},
biburl = {https://www.bibsonomy.org/bibtex/20510a780f6c8b831d96c7e50aa3f2802/dblp},
booktitle = {APPROX-RANDOM},
crossref = {conf/approx/2019},
editor = {Achlioptas, Dimitris and Végh, László A.},
ee = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.1},
interhash = {d37f9052cf9068c212e4cb299dd2078a},
intrahash = {0510a780f6c8b831d96c7e50aa3f2802},
isbn = {978-3-95977-125-2},
keywords = {dblp},
pages = {1:1-1:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-04-10T00:34:07.000+0200},
title = {The Query Complexity of Mastermind with lp Distances.},
url = {http://dblp.uni-trier.de/db/conf/approx/approx2019.html#FernandezW019},
volume = 145,
year = 2019
}
