✦ LIBER ✦

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

✍ Scribed by Chakrabarti, Amit; Regev, Oded

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved lower bound on the sensitivi

✍ Xiaoming Sun 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 313 KB

An asymptotic Hamming bound on the feedb

✍ Aaltonen, M. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 322 KB

Lower Bounds on the Randomized Communica

✍ Nikos Leonardos; Michael Saks 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 583 KB

Information-Theoretic Lower Bounds on th

✍ Agarwal, A.; Bartlett, P.L.; Ravikumar, P.; Wainwright, M.J. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 401 KB

An Ω(n4/3) lower bound on the randomized

✍ Péter Hajnal 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 657 KB

An Ω(n5/4) lower bound on the randomized

✍ Valerie King 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 546 KB