Request file

Review/Citation:  ANSHU, A., GAVINSKY, Dmitry, JAIN, R., KUNDU, S., LEE, T., MUKHOPADHYAY, P., SANTHA, M., SANYAL, S. A composition theorem for randomized query complexity. In: LOKAM, S., RAMANUJAM, R., eds. 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2018, s. 1-13, č. článku 10. Leibniz International Proceedings in Informatics. ISBN 978-3-95977-055-2. ISSN 1868-8969
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.