Disjointness through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond
The disjointness problem—where Alice and Bob are given twosubsets of { 1 , ⋯ , n} and they have to check if their setsintersect—is a central problem in the world of communicationcomplexity. While both deterministic and randomized communicationcomplexities for this problem are known to be Θ (n) , it...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Birkhauser
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |