Pages that link to "Item:Q5501927"
From MaRDI portal
The following pages link to An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927):
Displaying 8 items.
- On the structure of the spectrum of small sets (Q507818) (← links)
- Still another rank determination of set intersection matrices with an application in communication complexity (Q1324468) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5918630) (← links)
- A generalization of a theorem of Rothschild and van Lint (Q5925692) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- Upper bounds on communication in terms of approximate rank (Q6635689) (← links)