Pages that link to "Item:Q3177758"
From MaRDI portal
The following pages link to Communication is Bounded by Root of Rank (Q3177758):
Displaying 15 items.
- The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- (Q2808527) (← links)
- Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity (Q3448858) (← links)
- (Q5092448) (← links)
- (Q5259620) (redirect page) (← links)
- An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
- Fourier Sparsity of GF(2) Polynomials (Q5740202) (← 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)
