For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i
✦ LIBER ✦
A lower bound for S-parameter for Walking Technicolor
✍ Scribed by S.R. Ignjatović
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 143 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0015-8208
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A lower bound for Ramsey's theorem
✍
Joram Hirschfeld
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 291 KB
L2-lower bounds for a special class of r
✍
Ursula Porod
📂
Article
📅
1995
🏛
Springer
🌐
English
⚖ 577 KB
A lower bound for Fisher's information m
✍
A. Plastino; A.R. Plastino; H.G. Miller; F.C. Khanna
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 346 KB
Estimating lower-bound fracture paramete
✍
J. Fernández-Sáez; J. Chao; J. Durán; J. M. Amo
📂
Article
📅
1993
🏛
Springer
🌐
English
⚖ 246 KB
A Lower Bound for Primality
✍
Eric Allender; Michael Saks; Igor Shparlinski
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 130 KB
Recent work by Bernasconi, Damm, and Shparlinski showed that the set of square-free numbers is not in AC 0 and raised as an open question whether similar (or stronger) lower bounds could be proved for the set of prime numbers. We show that the Boolean majority function is AC 0 -Turing reducible to t
Lower bound for quadratic losses of esti
✍
M. Radavičius
📂
Article
📅
1997
🏛
Springer
🌐
English
⚖ 580 KB