No. Title Author Year
1 Hardness of Function Composition for Semantic Read once Branching Programs Edmonds, Jeff et al. 2018
2 On the Communication Complexity of High-Dimensional Permutations Linial, Nati et al. 2018
3 Stabbing Planes Beame, Paul et al. 2018
4 Query-to-Communication Lifting for P^NP Göös, Mika et al. 2017
5 Randomized Communication vs. Partition Number Göös, Mika et al. 2017
6 Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs Cook, Stephen et al. 2016
7 The Landscape of Communication Complexity Classes Göös, Mika et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 7


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