An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ita:2003003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ITA:2003003 / rank | |||
Normal rank | |||
Latest revision as of 00:13, 30 December 2024
scientific article; zbMATH DE number 1931461
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
