✦ LIBER ✦

On rank vs. communication complexity

✍ Scribed by Noam Nisan; Avi Wigderson

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 420 KB
Volume: 15
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01192527

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matrix rank and communication complexity

✍ Bruno Codenotti; Gianna Del Corso; Giovanni Manzini 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 76 KB

The rank of a matrix seems to play a role in the context of communication complexity, a framework developed to analyze basic communication requirements of computational problems. We present some issues and open problems arising in this area, and put forward a number of research subjects in linear al

On the “log rank”-conjecture in communic

On the “log rank”-conjecture in communication complexity

✍ Ran Raz; Boris Spieker 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 887 KB

The “log rank” conjecture for modular co

The “log rank” conjecture for modular communication complexity

✍ C. Meinel; S. Waack 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 410 KB

Private vs. common random bits in commun

Private vs. common random bits in communication complexity

✍ Ilan Newman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 492 KB

On the communication complexity of polli

On the communication complexity of polling

✍ Adele A. Rescigno 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 701 KB

On Randomized One-round Communication Co

On Randomized One-round Communication Complexity

✍ I. Kremer; N. Nisan; D. Ron 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 525 KB