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

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