Electronic colloquium on computational complexity
Direct Product Theorems for Communication Complexity via Subdistribution Bounds.
Rahul Jain, Hartmut Klauck, Ashwin Nayak
Electronic colloquium on computational complexity
Rahul Jain, Hartmut Klauck, Ashwin Nayak