Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded-depth Frege complexity of Tseitin formulas for all graphs |
scientific article |
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
