Short resolution proofs for a sequence of tricky formulas
type: Item
instance of: scholarly article
title: Short resolution proofs for a sequence of tricky formulas
zbMATH Open document ID: 0858.68092
author: Gunnar Stålmarck
published in: Acta Informatica
publication date: 1996-10-27T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 938627
zbMATH Keywords: propositional formulas
MaRDI profile type: Publication
full work available at URL: s002360050044
OpenAlex ID: W2126362918
cites work: Polynomial size proofs of the propositional pigeonhole principle
cites work: The relative efficiency of propositional proof systems
cites work: The intractability of resolution
cites work: Über eine Art von Unvollständigkeit des Prädikatenkalküls der ersten Stufe
cites work: Short proofs for tricky formulas
cites work: Q5593816
DOI: 10.1007/S002360050044
description: scientific article; zbMATH DE number 938627