Unsatisfiable Linear CNF Formulas Are Large and Complex. (Q3113785): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Unsatisfiable Linear CNF Formulas Are Large and Complex. | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962941898 / rank | |||
Normal rank | |||
| Property / title | |||
Unsatisfiable Linear CNF Formulas Are Large and Complex. (English) | |||
| Property / title: Unsatisfiable Linear CNF Formulas Are Large and Complex. (English) / rank | |||
Normal rank | |||
Latest revision as of 11:00, 30 July 2024
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
