✦ LIBER ✦

On the computational power of random strings

✍ Scribed by Adam R. Day

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 886 KB
Volume: 160
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2009.03.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on the topological structure of ran

Note on the topological structure of random strings

✍ Cristian Calude; Cezar Câmpeanu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 470 KB

On the Topological Size of Sets of Rando

On the Topological Size of Sets of Random Strings

✍ M. Zimand 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 492 KB 👁 1 views

The Computational Power of ℳω

✍ Dag Normann; Christian Rørdam 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

On the power of two-local random reducti

On the power of two-local random reductions

✍ Lance Fortnow; Mario Szegedy 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 349 KB

On the computer generation of random con

On the computer generation of random convex hulls

✍ Luc Devroye 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 929 KB

Performance evaluation of random power c

Performance evaluation of random power capture on mobile communications

✍ Jyh-Horng Wen; Kuo-Gen Hsu; Jet-Chau Wen; Yi-Show Chen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract Power assignment schemes are man‐made methods to enhance the capture effect of radio communications. In a previous study, Wen and Yang investigated the combined capture effect of the fixed power assignment scheme, Rayleigh fading, and near–far effect on the performance of packet radios.