Login / Signup
A near-optimal direct-sum theorem for communication complexity.
Rahul Jain
Published in:
CoRR (2020)
Keyphrases
</>
computational complexity
worst case
information systems
database systems
search algorithm
communication patterns
neural network
machine learning
objective function
cooperative
multi agent systems
email
communication systems