No. Title Author Year
1 A Lower Bound for Sampling Disjoint Sets Göös, Mika et al. 2019
2 A ZPP^NP[1] Lifting Theorem Watson, Thomas 2019
3 Amplification with One NP Oracle Query Watson, Thomas 2019
4 Communication Complexity with Small Advantage Watson, Thomas 2018
5 Complexity of Unordered CNF Games Rahman, Md Lutfar et al. 2018
6 Communication Complexity of Statistical Distance Watson, Thomas 2017
7 Query-to-Communication Lifting for P^NP Göös, Mika et al. 2017
8 Randomized Communication vs. Partition Number Göös, Mika et al. 2017
9 The Landscape of Communication Complexity Classes Göös, Mika et al. 2016
10 Communication Complexity of Set-Disjointness for All Probabilities Göös, Mika et al. 2014
Current Page :
Number of result pages: 2
Number of documents: 12

DROPS-Home | Imprint | Privacy Published by LZI