45 search results - page 5 / 9 » On Constructing Parallel Pseudorandom Generators from One-Wa... |
FSTTCS
1993
Springer
15 years 5 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
101
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
102
click to vote
COCO
2003
Springer
15 years 6 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
130
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...