A simplified way of proving trade-off results for resolution
type: Item
instance of: scholarly article
title: A simplified way of proving trade-off results for resolution
zbMATH Open document ID: 1202.68388
author: Jakob Nordstrom
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 5773848
zbMATH Keywords: computational complexity
zbMATH Keywords: automatic theorem proving
zbMATH Keywords: proof complexity
zbMATH Keywords: resolution
zbMATH Keywords: trade-offs
zbMATH Keywords: length
zbMATH Keywords: width
zbMATH Keywords: space
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.06.006
OpenAlex ID: W2109895531
cites work: Space Complexity in Propositional Calculus
cites work: A combinatorial characterization of resolution width
cites work: Space complexity of random formulae in resolution
cites work: Short proofs are narrow—resolution made simple
cites work: Optimality of size-width tradeoffs for resolution
cites work: Space bounds for resolution
cites work: Narrow Proofs May Be Spacious:Separating Space and Width in Resolution
cites work: Q5302095
cites work: Q3221403
cites work: The complexity of facets resolved
cites work: Short resolution proofs for a sequence of tricky formulas
cites work: Q4945238
cites work: Hard examples for resolution
DOI: 10.1016/J.IPL.2009.06.006
description: scientific article; zbMATH DE number 5773848