No. Title Author Year
1 Query-To-Communication Lifting for BPP Using Inner Product Chattopadhyay, Arkadev et al. 2019
2 Short Proofs Are Hard to Find Mertz, Ian et al. 2019
3 Hardness of Function Composition for Semantic Read once Branching Programs Edmonds, Jeff et al. 2018
4 On the Communication Complexity of High-Dimensional Permutations Linial, Nati et al. 2018
5 Stabbing Planes Beame, Paul 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 Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs Cook, Stephen et al. 2016
9 The Landscape of Communication Complexity Classes Göös, Mika et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Imprint | Privacy Published by LZI