✦ LIBER ✦

Communication complexity in lattices

✍ Scribed by Rudolf Ahlswede; Ning Cai; Ulrich Tamm

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 467 KB
Volume: 6
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(93)90078-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Communication complexity

✍ Christos H. Papadimitriou; Michael Sipser 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 613 KB

Communication complexity hierarchy

✍ Juraj Hromkovič 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Algebraic techniques in communication co

Algebraic techniques in communication complexity

✍ Bruno Codenotti; Giovanni Manzini; Luciano Margara 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Quantum communication and complexity

✍ Ronald de Wolf 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 182 KB

In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be signiÿcantly lowered if we allow the parties the use of quantum communication. We surv

The complexity of functions on lattices

✍ J.W. Sander; R. Tijdeman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Let f : Z → {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x ∈ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with

Communication complexity of convex optim

Communication complexity of convex optimization

✍ John N Tsitsiklis; Zhi-Quan Luo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 692 KB

We consider a situation where each of two processors has access to a different convex functionA, i = 1,2, defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which f, + h is minimized, wi