Pages that link to "Item:Q1401365"
From MaRDI portal
The following pages link to Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365):
Displaying 9 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- (Q5092479) (← links)
