A feasibly constructive lower bound for resolution proofs
type: Item
instance of: scholarly article
title: A feasibly constructive lower bound for resolution proofs
zbMATH Open document ID: 0702.68065
DOI: 10.1016/0020-0190(90)90141-J
author: Toniann Pitassi
author: Stephen Cook
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 4151830
zbMATH Keywords: lower bound
zbMATH Keywords: resolution
zbMATH Keywords: constructive proof
zbMATH Keywords: polynomial time
MaRDI profile type: Publication
cites work: Resolution proofs of generalized pigeonhole principles
cites work: Many hard examples for resolution
cites work: The intractability of resolution
cites work: Q4739657
cites work: Hard examples for resolution
full work available at URL: 0020-0190(90)90141-j
OpenAlex ID: W2049059582
description: scientific article; zbMATH DE number 4151830