Relativisation Provides Natural Separations for Resolution-Based Proof Systems

DOI10.1007/11753728_17MaRDI QIDQ3434690zbMATH OpenOpenAlexFDO

Authors Stephan Stoyanov Danchev

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_17

Mathematics Subject Classification ID

Structure of proofs (03F07) Complexity of proofs (03F20)

Recommendations

• Relativization makes contradictions harder for resolution
• Computer Science Logic
• On the relative complexity of resolution refinements and cutting planes proof systems
• Short proofs are narrow -- resolution made simple
• Exponential separation between Res(k) and Res(k+1) for k n

Cited in

(8)

• Tight size-degree bounds for sums-of-squares proofs
• Strong ETH and resolution via games and the multiplicity of strategies
• The limits of tractability in resolution-based propositional proof systems
• Resolution Width and Cutting Plane Rank Are Incomparable
• Relativization makes contradictions harder for resolution
• The limits of tractability in resolution-based propositional proof systems
• Parameterized resolution with bounded conjunction
• Computer Science Logic

This page was built for publication: Relativisation Provides Natural Separations for Resolution-Based Proof Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434690)