The following pages link to Computer Science Logic (Q5292633):
Displaying 7 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- A note on propositional proof complexity of some Ramsey-type statements (Q627444) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)