Request file

Review/Citation:  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. Available: http://drops.dagstuhl.de/opus/volltexte/2019/10640/
Requested document:  Gavinsky.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.