No. Title Author Year
1 A Composition Theorem for Randomized Query Complexity Anshu, Anurag et al. 2018
2 Separating Quantum Communication and Approximate Rank Anshu, Anurag et al. 2017
3 Partition Bound Is Quadratically Tight for Product Distributions Harsha, Prahladh et al. 2016
4 Unidirectional Input/Output Streaming Complexity of Reversal and Sorting François, Nathanaël et al. 2014
5 A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound Harsha, Prahladh et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 5

DROPS-Home | Fulltext Search | Imprint Published by LZI