An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552)
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 1931461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Upper Bound on the Space Complexity of Random Formulae in Resolution |
scientific article; zbMATH DE number 1931461 |
Statements
An Upper Bound on the Space Complexity of Random Formulae in Resolution (English)
0 references
2002
0 references
satisfiability threshold
0 references
random unsatisfiable Boolean formula
0 references
0 references
0.9060962796211244
0 references
0.864297091960907
0 references
0.8592045307159424
0 references
