Login / Signup
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.
Rahul Jain
Hartmut Klauck
Ashwin Nayak
Published in:
STOC (2008)
Keyphrases
</>
extended abstract
worst case
upper bound
lower bound
communication systems
computational complexity
decision problems
communication overhead
communication networks
tight bounds
product recommendation
communication protocol
lower and upper bounds
space complexity
neural network
website
genetic algorithm