7 citations · 7 across the 1 of their papers we have counts for
1 paper
André Gronemeier
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca…