BPL = L ?
- From: "Dillon" <dillongeo@xxxxxxxxx>
- Date: Sat, 12 Apr 2008 09:54:34 -0500
Hi,
I am stuck with the following problem, can someone help me? Thanks!
If there is a pseudo-random generator G: {0,1}^O(log n) -> {0, 1}^O(n^k) (k
is a natural number) for log(n) space-bounded probabilistic machines so that
G is computable in space linear in the input, then BPL = L. How to prove
this?
.
- Prev by Date: Re: How can I tell if F is a string or if it is a number?
- Next by Date: Re: How can I tell if F is a string or if it is a number?
- Previous by thread: jobs
- Next by thread: large datasets for classification and regression
- Index(es):
