No. Title Author Year
1 The Power of Many Samples in Query Complexity Bassilakis, Andrew et al. 2020
2 A Lower Bound for Sampling Disjoint Sets Göös, Mika et al. 2019
3 String Matching: Communication, Circuits, and Learning Golovnev, Alexander et al. 2019
4 A Tight Lower Bound for Entropy Flattening Chen, Yi-Hsiu et al. 2018
5 Adventures in Monotone Complexity and TFNP Göös, Mika et al. 2018
6 Query-to-Communication Lifting for P^NP Göös, Mika et al. 2017
7 Randomized Communication vs. Partition Number Göös, Mika et al. 2017
8 A Composition Theorem for Conical Juntas Göös, Mika et al. 2016
9 The Landscape of Communication Complexity Classes Göös, Mika et al. 2016
10 Communication Complexity of Set-Disjointness for All Probabilities Göös, Mika et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 10


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