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

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