✦ LIBER ✦

A lower bound for the pitman efficiency of Friedman type tests

✍ Scribed by Günter Rothe

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 163 KB
Volume: 1
Category: Article
ISSN: 0167-7152
DOI: 10.1016/0167-7152(83)90038-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for the ranks of CM types

✍ Liem Mai 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A Gersgorin-type lower bound for the sma

A Gersgorin-type lower bound for the smallest singular value

✍ Charles R. Johnson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Lower bounds for the length of test sequ

Lower bounds for the length of test sequences using UIOs

✍ Marion Rodrigues; Hasan Ural 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

Lower bounds for the distributions of ce

Lower bounds for the distributions of certain multivariate test statistics

✍ Yasunori Fujikoshi; Takafumi Isogai 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 277 KB

An efficient lower bound for the general

An efficient lower bound for the generalized spectral radius of a set of matrices

✍ Mohsen Maesumi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A lower bound for the circumference of a

A lower bound for the circumference of a graph

✍ Nathan Linial 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o