Tight lower bounds on the resolution complexity of perfect matching principles (Q4976395)
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 6754660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight lower bounds on the resolution complexity of perfect matching principles |
scientific article; zbMATH DE number 6754660 |
Statements
Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles (English)
0 references
28 July 2017
0 references
proof complexity
0 references
expander
0 references
perfect matching
0 references
resolution
0 references
width
0 references
0.9841170907020568
0 references
0.920742392539978
0 references
0.8493375182151794
0 references
0.7823445200920105
0 references
