![](/img/cover-not-exists.png)
[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - Direct product theorems for classical communication complexity via subdistribution bounds
Jain, Rahul, Klauck, Hartmut, Nayak, AshwinYear:
2008
Language:
english
DOI:
10.1145/1374376.1374462
File:
PDF, 308 KB
english, 2008