A Composition Theorem for Randomized Query Complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Anurag Anshu' in GoogleThis author has not been identified. Look up 'Dmitry Gavinsky' in GoogleThis author has not been identified. Look up 'Rahul Jain 0001' in GoogleThis author has not been identified. Look up 'Srijita Kundu' in GoogleThis author has not been identified. Look up 'Troy Lee' in GoogleThis author has not been identified. Look up 'Priyanka Mukhopadhyay' in GoogleThis author has not been identified. Look up 'Miklos Santha' in GoogleThis author has not been identified. Look up 'Swagato Sanyal' in Google

runs on WebDSL