Pages that link to "Item:Q5741834"
From MaRDI portal
The following pages link to Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834):
Displaying 9 items.
- Certifying equality with limited interaction (Q343864) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- (Q4568116) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Optimal (Euclidean) Metric Compression (Q5080486) (← links)
- (Q5091781) (← links)
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
- (Q6062152) (← links)
