Pages that link to "Item:Q2947567"
From MaRDI portal
The following pages link to Parameterized Bounded-Depth Frege Is not Optimal (Q2947567):
Displaying 9 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)