Provably hard problems below the satisfiability threshold Paul Beame Univ. of Washington Michael Molloy Univ. of Toronto Dimitris Achlioptas Microsoft Research A sharp threshold…
