Pages that link to "Item:Q1656588"
From MaRDI portal
The following pages link to Cops-robber games and the resolution of Tseitin formulas (Q1656588):
Displaying 7 items.
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)