Space complexity of random formulae in resolution (Q4417005)
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: Space complexity of random formulae in resolution |
scientific article; zbMATH DE number 1959946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space complexity of random formulae in resolution |
scientific article; zbMATH DE number 1959946 |
Statements
Space complexity of random formulae in resolution (English)
0 references
6 August 2003
0 references
space complexity of refuting unsatisfiable random formulas
0 references
lower bounds on the clause space
0 references
treelike resolution refutations
0 references
matching games on bipartite graphs
0 references
0 references
0.9060962796211244
0 references
0.8954211473464966
0 references
0.8580306768417358
0 references
0.8543506860733032
0 references
