Journal of Logic and Computation Advance Access originally published online on May 30, 2007
Journal of Logic and Computation 2007 17(3):587-604; doi:10.1093/logcom/exm017
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Original Articles |
On Independence of Variants of the Weak Pigeonhole Principle
ábek
Institute of Mathematics, AS CR,
itná 25, 115 67 Praha 1, Czech Republic. E-mail: jerabek@math.cas.cz
Received 14 August 2006.
| Abstract |
|---|
The principle
states that no oracle circuit can compute a surjection of a onto b. We show that
is independent of
for various choices of the parameters
,
,
, P. We also improve the known separation of iWPHP(PV) from
under cryptographic assumptions.
Keywords: Bounded arithmetic; pigeonhole principle; KPT witnessing; Boolean circuit