Pages that link to "Item:Q436623"

The following pages link to A lower bound on the size of resolution proofs of the Ramsey theorem (Q436623):

Displaying 2 items.

• The complexity of proving that a graph is Ramsey (Q1705815) (← links)
• An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)