✦ LIBER ✦

On the distributional complexity of disjointness

✍ Scribed by A.A. Razborov

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 322 KB
Volume: 106
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90260-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the disjoint paths

On the complexity of the disjoint paths problem

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 554 KB

Classifier performance as a function of

Classifier performance as a function of distributional complexity

✍ Sanju N. Attoor; Edward R. Dougherty 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 283 KB

When choosing a classiÿcation rule, it is important to take into account the amount of sample data available. This paper examines the performances of classiÿers of di ering complexities in relation to the complexity of feature-label distributions in the case of small samples. We deÿne the distributi

A Strong Direct Product Theorem for Corr

A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness

✍ Paul Beame; Toniann Pitassi; Nathan Segerlind; Avi Wigderson 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 395 KB

On the modulus of disjointness preservin

On the modulus of disjointness preserving operators on complex vector lattices

✍ Fethi Ben Amor; Karim Boulabiar 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 532 KB

On the complexity of vertex-disjoint len

On the complexity of vertex-disjoint length-restricted path problems

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB

On the complexity of the planar directed

On the complexity of the planar directed edge-disjoint paths problem

✍ Dirk Müller 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 278 KB