Computer Science – Computational Complexity
Scientific paper
2011-01-25
Computer Science
Computational Complexity
to be published in information processing letters
Scientific paper
We show that BPP has either SUBEXP-dimension zero (randomness is easy) or
BPP=EXP (randomness is intractable).
No associations
LandOfFree
A zero-one SUBEXP-dimension law for BPP 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 A zero-one SUBEXP-dimension law for BPP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A zero-one SUBEXP-dimension law for BPP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-542710