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


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