A note on the ε entropy of monotone functions in the levy norm
✍ Scribed by Peter Elias
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 217 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
2 &= and 1 2 +=. Given a family S [0, 1] n of binary strings of length n, its =-enhanced probability Pr = (S) is defined as the maximum of Pr X (S) over all =-biased random sources X. In this paper we establish a tight lower bound on Pr = (S) as a function of |S|, n and =.
The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num
We give sufficient conditions on a radial basis function that imply that the multi-integer translates of this radial function satisfy a local stability estimate in the uniform norm. "c" 1993 Academic Press. Inc.