Referenced Items are not available for this document.
We prove that any resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n∈), (for some constant ∈ > 0). One corollary is that a certain propositional formulation of the statement NP ⊄ P/poly does not have short resolution proofs
Published in:
Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
Date of Conference: 2002
- Page(s):
- 3
- Meeting Date :
- 21 May 2002-24 May 2002
- ISSN :
- 1093-0159
- Print ISBN:
- 0-7695-1468-5
- INSPEC Accession Number:
- 7329080
- Conference Location :
- Montreal, Que.
- Digital Object Identifier :
- 10.1109/CCC.2002.1004322
- 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.
