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


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