pdf-format: |
|
@InProceedings{bassilakis_et_al:LIPIcs:2020:12416, author = {Andrew Bassilakis and Andrew Drucker and Mika G{\"o}{\"o}s and Lunjia Hu and Weiyun Ma and Li-Yang Tan}, title = {{The Power of Many Samples in Query Complexity}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12416}, URN = {urn:nbn:de:0030-drops-124163}, doi = {10.4230/LIPIcs.ICALP.2020.9}, annote = {Keywords: Query complexity, Composition theorems} }
Keywords: | Query complexity, Composition theorems | |
Seminar: | 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) | |
Issue date: | 2020 | |
Date of publication: | 29.06.2020 |