scientific article
From MaRDI portal
Publication:3002781
DOI10.4086/toc.2007.v003a005zbMath1213.68303OpenAlexW2611365002MaRDI QIDQ3002781
Toniann Pitassi, Jan Johannsen, Alasdair Urquhart, Michael Alekhnovich
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2007.v003a005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (12)
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations ⋮ Regular and General Resolution: An Improved Separation ⋮ Special issue in memory of Misha Alekhnovich. Foreword ⋮ On Q-Resolution and CDCL QBF Solving ⋮ Finding a tree structure in a resolution proof is NP-complete ⋮ An Exponential Lower Bound for Width-Restricted Clause Learning ⋮ Expansion-based QBF solving versus Q-resolution ⋮ On Exponential Lower Bounds for Partially Ordered Resolution ⋮ On Linear Resolution ⋮ A Logical Autobiography ⋮ Reflections on Proof Complexity and Counting Principles ⋮ Characterizing Tseitin-formulas with short regular resolution refutations
Uses Software
This page was built for publication:
