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...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of the ACM 51, 2 (2004).
Hlavní autor:	Raz, R.
Médium:	Článek
Jazyk:	English
Témata:	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.