@MISC{Krajícek01onthe, author = {Jan Krajícek}, title = {On the Weak Pigeonhole Principle}, year = {2001} }

Years of Citing Articles

Bookmark

OpenURL

Abstract

We investigate the proof complexity, in (extensions of) resolution and in bounded arithmetic, of the weak pigeonhole principle and of Ramsey theorem. In particular, we link the proof complexity of these two principles. Further we give lower bounds to the width of resolution proofs and to the size of (extensions of) tree-like resolution proofs of Ramsey theorem. We establish a connection between provability of WPHP in fragments of bounded arithmetic and cryptographic assumptions (the existence of one-way functions). In particular, we show that functions violating WPHP 2n n are one-way and, on the other hand, that one-way permutations give rise to functions violating PHP n+1 n , and that strongly collision-free families of hash functions give rise to functions violating WPHP 2n n (all in suitable models of bounded arithmetic). Further we formulate few problems and conjectures; in particular, on the structured PHP (introduced here) and on the unrelativised WPHP. The symbol WPHP m n...