1 paper
Aleksandrs Belovs, Arturo Castellanos, François Le Gall +2
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two play…