Pages that link to "Item:Q1118569"
From MaRDI portal
The following pages link to A general 4-words inequality with consequences for 2-way communication complexity (Q1118569):
Displaying 9 items.
- On a restricted cross-intersection problem (Q855846) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- Rank formulas for certain products of matrices (Q1311620) (← links)
- Code pairs with specified parity of the Hamming distances (Q1584332) (← links)
- Deterministic communication complexity of set intersection (Q1897354) (← links)
- Fractional cross intersecting families (Q2657100) (← links)
- On Extremal Set Partitions in Cartesian Product Spaces (Q4289289) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)
- Maximal fractional cross-intersecting families (Q6166666) (← links)