Computer Science Logic

DOI10.1007/b13224zbMath1116.03336OpenAlexW2623947920MaRDI QIDQ5292633

Søren Riis, Stefan S. Dantchev

Publication date: 21 June 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (7)

Relativization makes contradictions harder for resolution ⋮ Tight size-degree bounds for sums-of-squares proofs ⋮ The limits of tractability in resolution-based propositional proof systems ⋮ A note on propositional proof complexity of some Ramsey-type statements ⋮ Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems ⋮ Partially definable forcing and bounded arithmetic ⋮ The treewidth of proofs

This page was built for publication: Computer Science Logic