4 problems

Consider the random K-LSAT linear program with $n$ variables and $m$ constraints, with all auxiliary variables $\psi$ set to zero. Let $N(n,m)$ be the maximum cardinality of a feas…

Let $c^*_K$ be the constant introduced in the source's theorem for the optimal value ${\cal LP}(n,c)$ of the random K-LSAT linear program, and consider the corresponding feasibilit…

Let $N(n,m)$ be the maximum number of clauses that can be satisfied by one assignment of $n$ variables in a random K-SAT instance with $m$ clauses, and let $c^*_K$ be the threshold…

Monasson et al.'s mixed-SAT conjecture. For every $p\in[0,1]$ there exists a value $\alpha_\mathrm{sat}(2+p)>0$ such that, whenever $\alpha_2,\alpha_3>0$ satisfy…