Characterization of classical and non-signaling behavior sets in general communication scenarios

It provides the characterization of the classical and non-signaling polytopes for the (3,2;2,2) and (4,2;2,2) general communication scenarios. The complete characterizations are provided in the PANDA (Parallel AdjaceNcy Decomposition Algorithm) format, in both vertex and facet representations, with elements grouped into equivalence classes.

The dataset also includes Python scripts used to generate deterministic points and non-negativity inequalities. For the (3,2;2,2) scenario, the dataset contains the full characterization of both the classical set and the non-signaling set of the corresponding Bell scenario. For the (4,2;2,2) scenario, only the characterization of the non-signaling set of the corresponding Bell scenario is included.