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


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