Computer Science – Logic in Computer Science
Scientific paper
2006-08-07
Mathematical Logic Quarterly 52(6):575-584, 2006
Computer Science
Logic in Computer Science
11 pages
Scientific paper
10.1002/malq.200610015
It is well known that S^1_2 cannot prove the injective weak pigeonhole
principle for polynomial time functions unless RSA is insecure. In this note we
investigate the provability of the surjective (dual) weak pigeonhole principle
in S^1_2 for provably weaker function classes.
Danner Norman
Pollett Chris
No associations
LandOfFree
The weak pigeonhole principle for function classes in S^1_2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The weak pigeonhole principle for function classes in S^1_2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The weak pigeonhole principle for function classes in S^1_2 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-600932