𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Analogues of Horn’s theorem for finite unions of starshaped sets in ℝd

✍ Scribed by Marilyn Breen

Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
121 KB
Volume
59
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Families of Finite Sets in which No Inte
Families of Finite Sets in which No Intersection of ℓ Sets Is Covered by the Union of s Others
✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (

Looking for an Analogue of Rice's Theore
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
✍ Bernd Borchert; Frank Stephan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

Rice's Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect a