Pages that link to "Item:Q1897981"
From MaRDI portal
The following pages link to Two-way communication complexity of sum-type functions for one processor to be informed (Q1897981):
Displaying 8 items.
- A general 4-words inequality with consequences for 2-way communication complexity (Q1118569) (← links)
- Rank formulas for certain products of matrices (Q1311620) (← links)
- Still another rank determination of set intersection matrices with an application in communication complexity (Q1324468) (← links)
- Communication complexity of sum-type functions invariant under translation (Q1891145) (← links)
- (Q4449184) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)
- Fundamentals of Computation Theory (Q5900794) (← links)