Mutilated chessboard problem is exponentially hard for resolution

Authors:
Michael Alekhnovich
Affiliations:
Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge MA
Venue:
Theoretical Computer Science
Year:
2004

Citing 8
Cited 3

Short proofs for tricky formulas

Acta Informatica
Many hard examples for resolution

Journal of the ACM (JACM)
Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Regular resolution lower bounds for the weak pigeonhole principle

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution Proofs of Matching Principles

Annals of Mathematics and Artificial Intelligence
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
"Planar" Tautologies Hard for Resolution

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

Resolution Proofs of Matching Principles

Annals of Mathematics and Artificial Intelligence
Resolution for Max-SAT

Artificial Intelligence
Limitations of restricted branching in clause learning

Constraints

Quantified Score

Hi-index	5.23

Visualization

Abstract

Mutilated chessboard principle CBn says that it is impossible to cover by domino tiles the chessboard 2n × 2n with two diagonally opposite corners removed. We prove 2ω(√n) lower bound on the size of minimal resolution refutation of CBn.