Pages that link to "Item:Q3167423"
From MaRDI portal
The following pages link to Sparse and Lopsided Set Disjointness via Information Theory (Q3167423):
Displaying 11 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Robust property-preserving hash functions for Hamming distance and more (Q2056796) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- The randomized communication complexity of set disjointness (Q3002788) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- (Q5121896) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- (Q5875509) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)