๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithm 357: an efficient prime number generator [A1]

โœ Scribed by Singleton, Richard C.

Book ID
120921004
Publisher
Association for Computing Machinery
Year
1969
Tongue
English
Weight
656 KB
Volume
12
Category
Article
ISSN
0001-0782

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for inversing a unification
An algorithm for inversing a unification parser into an efficient unification generator
โœ Tomek Strzalkowski ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

An algorithm that inverses a unifkaticn parser written in FXOLOG into a generator for naNd language is presented. Some aspects of applicability of the algorithm arc discussed. ' MSEA'S of basic predicates, such as mncat. art assumed to k known apriori; MSEA'S for recunive predicates are first comput

An efficient lattice reduction method fo
An efficient lattice reduction method for -linear pseudorandom number generators using Mulders and Storjohann algorithm
โœ Shin Harase ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

Recent simulations often use highly parallel machines with many processors, and they need many pseudorandom number generators with distinct parameter sets, and hence we need an effective fast assessment of the generator with a given parameter set. Linear generators over the two-element field are goo