By Topic

"Planar" tautologies hard for resolution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dantchev, S. ; Dept. of Comput. Sci., Aarhus Univ., Denmark ; Riis, S.

We prove exponential lower bounds on the resolution proofs of some tautologies, based on rectangular grid graphs. More specifically, we show a 2Ω(n) lower bound for any resolution proof of the mutilated chessboard problem on a 2n×2n chessboard as well as for the Tseitin tautology (G. Tseitin, 1968) based on the n×n rectangular grid graph. The former result answers a 35 year old conjecture by J. McCarthy (1964).

Published in:

Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on

Date of Conference:

8-11 Oct. 2001