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.
Abstract
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: | PDF - Published Version (228Kb) |
| Status: | Peer-reviewed |
| Publisher Web site: | http://dx.doi.org/10.1109/SFCS.2001.959896 |
| 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. |
| Record Created: | 27 Feb 2008 |
| Last Modified: | 01 Nov 2010 15:13 |
Social bookmarking:       | Export: EndNote, Zotero | BibTex |
| Usage statistics | Look up in GoogleScholar | Find in a UK Library |
![[Feed]](/images/RSSwebsmall.jpg)
![[Tweets]](/images/Twitterwebsmall.png)
