Pages that link to "Item:Q436623"
From MaRDI portal
The following pages link to A lower bound on the size of resolution proofs of the Ramsey theorem (Q436623):
Displaying 7 items.
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Co-Nondeterminism in Compositions (Q4962153) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- A fixed-depth size-hierarchy theorem for AC <sup>0</sup> [⊕] via the coin problem (Q5212785) (← links)
- (Q5875713) (← links)
- Formalizing finite Ramsey theory in Lean 4 (Q6648159) (← links)