Limit probabilities for random sparse bit strings.
The Electronic Journal of Combinatorics [electronic only] (1997)
- Volume: 4, Issue: 1, page Research paper R23, 14 p.-Research paper R23, 14 p.
- ISSN: 1077-8926
Access Full Article
topHow to cite
topSt.John, Katherine. "Limit probabilities for random sparse bit strings.." The Electronic Journal of Combinatorics [electronic only] 4.1 (1997): Research paper R23, 14 p.-Research paper R23, 14 p.. <http://eudml.org/doc/119196>.
@article{St1997,
author = {St.John, Katherine},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {random unary predicate under linear order; almost sure theory; infinitely differentiable functions},
language = {eng},
number = {1},
pages = {Research paper R23, 14 p.-Research paper R23, 14 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Limit probabilities for random sparse bit strings.},
url = {http://eudml.org/doc/119196},
volume = {4},
year = {1997},
}
TY - JOUR
AU - St.John, Katherine
TI - Limit probabilities for random sparse bit strings.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1997
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 4
IS - 1
SP - Research paper R23, 14 p.
EP - Research paper R23, 14 p.
LA - eng
KW - random unary predicate under linear order; almost sure theory; infinitely differentiable functions
UR - http://eudml.org/doc/119196
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.