Mutilated chessboard problem is exponentially hard for resolution
type: Item
instance of: scholarly article
title: Mutilated chessboard problem is exponentially hard for resolution
zbMATH Open document ID: 1071.68028
DOI: 10.1016/S0304-3975(03)00395-5
author: Michael Alekhnovich
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 2111071
zbMATH Keywords: Propositional proof complexity
zbMATH Keywords: Resolution
zbMATH Keywords: Lower bounds
Wikidata QID: Q57532686
MaRDI profile type: Publication
cites work: Short proofs are narrow -- resolution made simple
cites work: Many hard examples for resolution
cites work: Short proofs for tricky formulas
cites work: Regular resolution lower bounds for the weak pigeonhole principle
cites work: Resolution lower bounds for the weak pigeonhole principle
cites work: Resolution proofs of matching principles
DBLP publication ID: journals/tcs/Alekhnovich04
description: scientific article; zbMATH DE number 2111071