We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Planar tautologies hard for resolution.

Dantchev, S. and Riis, S. (2001) 'Planar tautologies hard for resolution.', in 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada ; proceedings. New York: IEEE, pp. 220-229.


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

Item Type:Book chapter
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Publisher statement:© 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Date accepted:No date available
Date deposited:01 November 2010
Date of first online publication:October 2001
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar