Unsatisfiable Linear CNF Formulas Are Large and Complex. (Q3113785)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unsatisfiable Linear CNF Formulas Are Large and Complex. |
scientific article |
Statements
23 January 2012
0 references
extremal combinatorics
0 references
proof complexity
0 references
probabilistic method
0 references
Unsatisfiable Linear CNF Formulas Are Large and Complex. (English)
0 references
