Počet záznamů: 1
A composition theorem for randomized query complexity via Max-conflict complexity
- 1.GAVINSKY, Dmitry, LEE, T., SANTHA, M., SANYAL, S. A composition theorem for randomized query complexity via Max-conflict complexity. In: BAIER, Ch., CHATZIGIANNAKIS, I., FLOCCHINI, P., LEONARDI, S., eds. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2019, č. článku 64. Leibniz International Proceedings in Informatics LIPIcs, 132. ISBN 978-3-95977-109-2. ISSN 1868-8969. Dostupné z: doi: 10.4230/LIPIcs.ICALP.2019.64.
Počet záznamů: 1