𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randomized algorithms in number theory

✍ Scribed by Michael O. Rabin; Jeffery O. Shallit

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
832 KB
Volume
39
Category
Article
ISSN
0010-3640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A theory of random numbers
A theory of random numbers
✍ E.M Kleinberg πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 633 KB
Algorithmic theory of random graphs
Algorithmic theory of random graphs
✍ Alan Frieze; Colin McDiarmid πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 318 KB πŸ‘ 2 views

The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariantsᎏsee Bollobas 21 . There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this pap

Random hypergraph coloring algorithms an
Random hypergraph coloring algorithms and the weak chromatic number
✍ Jeanette Schmidt-Pruzan; Eli Shamir; Eli Upfal πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 610 KB

We present a hypergraph coloring algorithm and analyze its performance in spaces of random hypergraphs. In these spaces the number of colors used by our algorithm is almost surely within a small constant factor (less than 2) of the weak chromatic number of the hypergraph. This also establishes new u

A portable high-quality random number ge
A portable high-quality random number generator for lattice field theory simulations
✍ Martin LΓΌscher πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 946 KB

The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an algorithm introduced by Marsaglia and Zaman, with an important added feature leading to demonstrably good statistical