Searching for "Pseudorandom Number Generation and Space Complexity." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A Survey of TES Modeling Applications
by Benjamin Melamed, Jon R. Hill — 1995
… that of the underlying pseudo-random number generator, and their space complexity is negligible. The second advantage…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB