activity
20152022
most citedThe success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2015

Approximation of non-boolean 2CSP

Guy Kindler, Alexandra Kolla, Luca Trevisan

We develop a polynomial time approximate algorithm for Max 2CSP-, the problem where we are given a collection of constraints, each involving t…