✦ LIBER ✦

A generalization of the Neumann-Pearson lemma in the theory of signal recognition

✍ Scribed by Yu. V. Kuk

Book ID: 105057281
Publisher: Springer US
Year: 1978
Tongue: English
Weight: 343 KB
Volume: 14
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Hardy–Littlewood lemma and the estim

The Hardy–Littlewood lemma and the estimate of the -Neumann problem in a general norm

✍ Pinton, Stefano 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 442 KB

A generalization of the Borel–Cantelli L

A generalization of the Borel–Cantelli Lemma

✍ Valentin V. Petrov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

A generalization of the bounded real lem

A generalization of the bounded real lemma

✍ Ákos László 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On a generalization of the Kalman-Yakubo

On a generalization of the Kalman-Yakubovic lemma

✍ A. V. Balakrishnan 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 314 KB

A generalization of the lemma of Du Bois

A generalization of the lemma of Du Bois-Reymond

✍ R Martini 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 195 KB

An application of the regularity lemma i

An application of the regularity lemma in generalized Ramsey theory

✍ Gábor N. Sárközy; Stanley M. Selkow 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract Given graphs __G__ and __H__, an edge coloring of __G__ is called an (__H__,__q__)‐coloring if the edges of every copy of __H__ ⊂ __G__ together receive at least __q__ colors. Let __r__(__G__,__H__,__q__) denote the minimum number of colors in a (__H__,__q__)‐coloring of __G__. In 9 Erd