Unified Characterisations of Resolution Hardness Measures

DOI10.1007/978-3-319-09284-3_13zbMath1423.68409DBLPconf/sat/BeyersdorffK14OpenAlexW1963246346WikidataQ59900284 ScholiaQ59900284MaRDI QIDQ3192062

Olaf Beyersdorff, Oliver Kullmann

Publication date: 26 September 2014

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

Full work available at URL: http://eprints.whiterose.ac.uk/80490/1/2014_PHP.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (5)

Feasible Interpolation for QBF Resolution Calculi ⋮ A game characterisation of tree-like Q-resolution size ⋮ Space characterizations of complexity measures and size-space trade-offs in propositional proof systems ⋮ A Game Characterisation of Tree-like Q-resolution Size ⋮ Total Space in Resolution

This page was built for publication: Unified Characterisations of Resolution Hardness Measures