Unsatisfiable linear CNF formulas are large and complex (Q3113785)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5999732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unsatisfiable linear CNF formulas are large and complex |
scientific article; zbMATH DE number 5999732 |
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
0.862746000289917
0 references
0.8614612221717834
0 references
0.8537716865539551
0 references
0.8231443762779236
0 references
