Pages that link to "Item:Q4850308"
From MaRDI portal
The following pages link to On communication complexity of vector-valued functions (Q4850308):
Displaying 9 items.
- A characterization of average case communication complexity (Q845939) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)
- A general 4-words inequality with consequences for 2-way communication complexity (Q1118569) (← links)
- Communication complexity in lattices (Q1324492) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- Deterministic communication complexity of set intersection (Q1897354) (← links)
- Two-way communication complexity of sum-type functions for one processor to be informed (Q1897981) (← links)
- (Q4016535) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)