A note on the partition bound for one-way classical communication complexity.
Srinivasan ArunachalamJoão F. DoriguelloRahul JainPublished in: CoRR (2023)
Keyphrases
- worst case
- upper bound
- computational complexity
- lower bound
- communication systems
- communication cost
- space complexity
- decision problems
- information sharing
- lower complexity
- communication protocol
- communication technologies
- communication networks
- memory requirements
- database
- np hard
- image segmentation
- social networks
- artificial intelligence
- databases