1 citations · 1 across the 9 of their papers we have counts for
1 paper · 1 filter
Gaia Carenini
We prove a general upper bound for scaling windows of sparse monotone covering problems. From that, we deduce that for every fixed value k≥3, the window of random k-SAT is…