𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for 0,1,∗ tournament codes

✍ Scribed by Karen L. Collins; Peter W. Shor; John R. Stembridge

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
220 KB
Volume
63
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for Primality
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

A lower bound for level spacings
A lower bound for level spacings
✍ Elliott H Lieb; Walter E Thirring 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 352 KB

We consider a single particle in a negative potential V: H = --d + V(x). A lower bound is found for the quantity +I -EW, where cm is the ground-state energy of H in all space and where EA is the ground-state energy of H in a bounded domain A with Dirichlet ($ = 0) boundary conditions. Our estimate f

A lower bound for radio broadcast
A lower bound for radio broadcast
✍ Noga Alon; Amotz Bar-Noy; Nathan Linial; David Pelegi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 479 KB
A lower bound for Ramsey's theorem
A lower bound for Ramsey's theorem
✍ Joram Hirschfeld 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 291 KB

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