Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions.
Kazumasa ShinagawaKoji NuidaPublished in: INDOCRYPT (2) (2023)
Keyphrases
- lower bound
- worst case
- upper bound
- average case complexity
- objective function
- complexity measures
- communication overhead
- branch and bound algorithm
- branch and bound
- information systems
- memory requirements
- np hard
- computational complexity
- space complexity
- search algorithm
- communication protocol
- data structure
- linear programming
- computer networks
- special case
- optimal cost
- learning algorithm