Pages that link to "Item:Q623504"
From MaRDI portal
The following pages link to Communication complexity under product and nonproduct distributions (Q623504):
Displaying 11 items.
- The hardest halfspace (Q1983325) (← links)
- Upper and lower bounds on the power of advice (Q2816830) (← links)
- The communication complexity of interleaved group products (Q2941525) (← links)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- Amortized Communication Complexity of Distributions (Q3638077) (← links)
- Partition bound is quadratically tight for product distributions (Q4598278) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- Correlation in Hard Distributions in Communication Complexity (Q5351922) (← links)
- (Q5743425) (← links)