Resolution lower bounds for the weak pigeonhole principle.

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 global constant ε > 0). One corollary is that a certain propositional formulation of the statement NP ⊄ P/poly does not have short Resolut...

Cur síos iomlán

Sonraí bibleagrafaíochta

Foilsithe in:	Journal of the ACM 51, 2 (2004).
Príomhchruthaitheoir:	Raz, R.
Formáid:	Alt
Teanga:	English
Ábhair:	Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Complexity of proof procedures. Mathematical logic and formal languages. Mathematical logic. Proof theory. Theory.