Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility

Mark Braverman, Gillat Kol, Shay Moran +1

We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\subseteq {\mathbb{R}}^d$ of size $|U|=n$. T…