<--- Back to Details
First PageDocument Content
Modular arithmetic / Integer sequences / Prime number / Derrick Henry Lehmer / Mersenne prime / Pseudorandomness / Lehmer / Lehmer random number generator / Lucas–Lehmer primality test / Mathematics / Number theory / Pseudorandom number generators
Date: 2012-03-14 05:33:29
Modular arithmetic
Integer sequences
Prime number
Derrick Henry Lehmer
Mersenne prime
Pseudorandomness
Lehmer
Lehmer random number generator
Lucas–Lehmer primality test
Mathematics
Number theory
Pseudorandom number generators

Add to Reading List

Source URL: www.firstpr.com.au

Download Document from Source Website

File Size: 326,92 KB

Share Document on Facebook

Similar Documents

Lecture Notes on Pseudorandomness { Part I Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. email:

DocID: 1v2G7 - View Document

Pseudorandomness for Network Algorithms Russell Impagliazzo ∗ Noam Nisan

DocID: 1unPp - View Document

Contents Pseudorandomness { Part II Introduction Lecture 1. Deterministic Simulation of Randomized Algorithms 1. Probabilistic Algorithms versus Deterministic Algorithms 2. De-randomization Under Complexity Assumptions

DocID: 1ukkf - View Document

Pseudorandomness Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. March 27, 2000

DocID: 1udL1 - View Document

Pseudorandomness  Thursday, September 21, :11 PM 2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824

DocID: 1tDzT - View Document