Discrete Lunch‎ > ‎

April 13: Random k-SAT with other domains than {0,1}

posted Apr 12, 2015, 11:28 PM by Dirk Oliver Theis   [ updated Apr 24, 2015, 3:31 AM ]
Today, for Discrete Lunch, we'll discuss a hypergraph coloring problem which arises from a question about thresholds for the satisfiability of random SAT instances.
Comments