Referenced Items are not available for this document.
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
- Page(s):
- 220 - 229
- Print ISBN:
- 0-7695-1116-3
- INSPEC Accession Number:
- 7121395
- Digital Object Identifier :
- 10.1109/SFCS.2001.959896
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
