28 citations · 127 across the 46 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CC2019★ 2 cited
On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem
Mika Göös, Pritish Kamath, Katerina Sotiraki +1
We study the search problem class defined as a modulo- analog of the well-known class introduced by Papadim…
math.ST2019
Efficient Truncated Statistics with Unknown Truncation
Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis
We study the problem of estimating the parameters of a Gaussian distribution when samples are only shown if they fall in some (unknown) subset . This core problem…
cs.LG2019★ 2 cited
Optimal Learning of Mallows Block Model
Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi +1
The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group . To analyze more complex rank…