Pages that link to "Item:Q1430570"
From MaRDI portal
The following pages link to Hard examples for the bounded depth Frege proof system (Q1430570):
Displaying 12 items.
- Non-automatizability of bounded-depth Frege proofs (Q1764155) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Exponential lower bounds for \(\mathrm{AC}^0\)-Frege imply superpolynomial Frege lower bounds (Q2828228) (← links)
- Hard examples for resolution (Q3780485) (← links)
- (Q4850545) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)