✦ LIBER ✦

A theory of random numbers

✍ Scribed by E.M Kleinberg

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 633 KB
Volume: 39
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(81)90057-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Putting theory into practice: a cluster

Putting theory into practice: a cluster randomized trial with a small number of clusters

✍ P. L. Yudkin; M. Moher 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB 👁 1 views

Randomized algorithms in number theory

✍ Michael O. Rabin; Jeffery O. Shallit 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 832 KB

A random-number generator

✍ T.A. Brody 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Random access to a random number sequenc

Random access to a random number sequence

✍ E.H. Canfield Jr.; J.A. Viecelli 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 50 KB

Random access to a random number sequenc

Random access to a random number sequence

✍ E.H. Canfield Jr.; J.A. Viecelli 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 218 KB

The chromatic numbers of random hypergra

The chromatic numbers of random hypergraphs

✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

For a pair of integers 1 F ␥r, the ␥-chromatic number of an r-uniform Ž . hypergraph H s V, E is the minimal k, for which there exists a partition of V into subsets < < T, . . . , T such that e l T F ␥ for every e g E. In this paper we determine the asymptotic 1 k i Ž . behavior of the ␥-chromatic n