Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956)
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: Bounded-depth Frege complexity of Tseitin formulas for all graphs |
scientific article; zbMATH DE number 7601549
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded-depth Frege complexity of Tseitin formulas for all graphs |
scientific article; zbMATH DE number 7601549 |
Statements
Bounded-depth Frege complexity of Tseitin formulas for all graphs (English)
0 references
14 October 2022
0 references
proof complexity
0 references
bounded-depth Frege
0 references
resolution
0 references
Tseitin formulas
0 references
treewidth
0 references
0 references
0 references
0 references
0 references
0 references
0.82174504
0 references
0.7928248
0 references
0.7910837
0 references
0.7904644
0 references
0.7697872
0 references
0.7662927
0 references
0.75549746
0 references
0.7530853
0 references
0.7363147
0 references
