Pages that link to "Item:Q1891145"
From MaRDI portal
The following pages link to Communication complexity of sum-type functions invariant under translation (Q1891145):
Displaying 9 items.
- Rank formulas for certain products of matrices (Q1311620) (← links)
- Functional inversion and communication complexity (Q1335026) (← links)
- Two-way communication complexity of sum-type functions for one processor to be informed (Q1897981) (← links)
- Communication complexity of some number theoretic functions (Q2470553) (← links)
- Communication complexity and orthogonal polynomials (Q2717211) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← 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)