Relating size and width in variants of Q-resolution
type: Item
instance of: scholarly article
title: Relating size and width in variants of Q-resolution
zbMATH Open document ID: 1458.03043
author: Judith Clymo
author: Olaf Beyersdorff
published in: Information Processing Letters
publication date: 2018-07-17T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6904558
zbMATH Keywords: computational complexity
zbMATH Keywords: proof complexity
zbMATH Keywords: QBF
zbMATH Keywords: resolution
zbMATH Keywords: lower bound techniques
describes a project that uses: DepQBF
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.05.005
OpenAlex ID: W2804939161
cites work: Unified QBF certification and its applications
cites work: QBF Resolution Systems and Their Proof Complexities
cites work: Short proofs are narrow—resolution made simple
cites work: Lower bounds: from circuits to QBF proof systems
cites work: Q5270089
cites work: Are Short Proofs Narrow? QBF Resolution Is Not So Simple
cites work: Towards NP-P via proof complexity and search
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
cites work: Expansion-based QBF solving versus Q-resolution
cites work: On Q-Resolution and CDCL QBF Solving
cites work: Resolution for quantified Boolean formulas
cites work: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving
Wikidata QID: Q129803932
DOI: 10.1016/J.IPL.2018.05.005
description: scientific article; zbMATH DE number 6904558