✦ LIBER ✦

Lower bounds on communication overlap of networks

✍ Scribed by J.W. Hong; Q. Zuo

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 296 KB
Volume: 47
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90156-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

On lower bounds of exponential frames

✍ Alexander M. Lindner 📂 Article 📅 1999 🏛 SP Birkhäuser Verlag Boston 🌐 English ⚖ 363 KB

A Gödel Theorem on Network Complexity Lo

A Gödel Theorem on Network Complexity Lower Bounds

✍ C. P. Schnorr 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 550 KB

A linear lower bound on the unbounded er

A linear lower bound on the unbounded error probabilistic communication complexity

✍ Jürgen Forster 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfÀ1; 1g nÂn and any matrix MAR nÂn such that signð Mi;j Þ ¼ M i;j for all i; j; then rankð MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

A new lower bound on the monotone networ

A new lower bound on the monotone network complexity of Boolean sums

✍ Ingo Wegener 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 282 KB