1 paper
JarosÅaw BÅasiok, Linus Meierhöfer
We consider a problem of approximating the size of the largest clique in a graph, with a monotone circuit. Concretely, we focus on distinguishing a random ErdÅs-Renyi graph $\math…