5 problems

Fixed-order OBDD-size conjecture. In that case, we conjecture that the OBDD size is large even below the treewidth threshold, as there is no way to exploit the structure of the pri…

Polynomial block-count conjecture. The value of $\beta(k)$ is polynomial in $\log(bl(k)+1)$; equivalently, there exist a sufficiently large constant $C$ and a function $f(x)$ polyn…

Rahman–Watson conjecture. Their results remain true for general 3-CNF formulas without the constraint that each clause has a spare variable, except that the required number of roun…

General resolution-proof certificate conjecture. For any unsatisfiable formula $F$ and resolution proof $T$, the resulting vector $\bm\mu$ satisfies

Variable-occurrence conjecture. There is a variable $z \in \mathsf{var}(F)$ such that