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 this page instead for the normal view: An Upper Bound on the Space Complexity of Random Formulae in Resolution |
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