Access Restriction

Author Raz, Ran
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2004
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword P different than NP ♦ Lower bounds ♦ Computational complexity ♦ Proof complexity ♦ Propositional logic
Abstract We prove that any Resolution proof for the weak pigeonhole principle, with $\textit{n}$ holes and any number of pigeons, is of length $Ω(2^{n^{ε}}),$ (for some global constant ε > 0). One corollary is that a certain propositional formulation of the statement $\textit{NP}$ ⊄ $\textit{P}/\textit{poly}$ does not have short Resolution proofs.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2004-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 51
Issue Number 2
Page Count 24
Starting Page 115
Ending Page 138

Open content in new tab

   Open content in new tab
Source: ACM Digital Library