Export Citations
1 Results for: Book/Issue: STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,793,946 records)|Limit your search to The ACM Full-Text Collection (767,191 records)
Showing 1 - 1of1 Results
Select All
- research-articleMay 2008
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingPages 599–608https://doi.org/10.1145/1374376.1374462A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance. We investigate this question in various models of ...