No. Title Author Year
1 A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity Gavinsky, Dmitry et al. 2019
2 A Composition Theorem for Randomized Query Complexity Anshu, Anurag et al. 2018
3 Linear Sketching over F_2 Kannan, Sampath et al. 2018
4 The Zero-Error Randomized Query Complexity of the Pointer Function Radhakrishnan, Jaikumar et al. 2016
5 Towards Better Separation between Deterministic and Randomized Query Complexity Mukhopadhyay, Sagnik et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI