A characterization of tree-like resolution size (Q2444907)
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 6282960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of tree-like resolution size |
scientific article; zbMATH DE number 6282960 |
Statements
A characterization of tree-like resolution size (English)
0 references
11 April 2014
0 references
computational complexity
0 references
proof complexity
0 references
Prover-Delayer games
0 references
resolution
0 references
0 references
0 references
0.8665900230407715
0 references
0.8664140701293945
0 references
0.8629902601242065
0 references
0.7880622148513794
0 references
0.7864335775375366
0 references
