A Composition Theorem for Randomized Query Complexity

Anurag Anshu, Dmitry Gavinsky, Rahul Jain 0001, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal. A Composition Theorem for Randomized Query Complexity. In Satya V. Lokam, R. Ramanujam, editors, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India. Volume 93 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Abstract

Abstract is missing.