Jordan Ellenberg

Detection of Planted Solutions for Flat Satisfiability Problems

We study the detection problem of finding planted solutions in random instances of flat satisfiability problems, a generalization of boolean satisfiability formulas. We describe the properties of random instances of flat satisfiability, as well of the optimal rates of detection of the associated hyp…