Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 193 Bytes

File metadata and controls

5 lines (3 loc) · 193 Bytes

Is a randomly generated 4-CNF sentence with $n$ symbols and $m$ clauses more or less likely to be solvable than a randomly generated 3-CNF sentence with $n$ symbols and $m$ clauses? Explain.