相关论文: Improved direct sum theorem in classical communica…

We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carath\'eodory's theorems.

This article has been withdrawn due to an error in a proof of the main result.

We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f subset of X x Y x Z. We show: Q^{1,pub}(f^m) = Omega(m Q^{1,pub}(f)), where Q^{1,pub}(f), represents the one-way…

This paper has been withdrawn due to an error, and no further revisions will be made.

We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact…

This paper has been withdrawn by the author(s), due a crucial sign error in Thm. 11.

This paper has been withdrawn by the author, due to a significant error in section 4.3.1.

The paper was retracted.

This paper has been withdrawn because of serious errors.

This paper has been withdrawn by the author due to a crucial sign error in equation 1

The paper has been withdrawn due to a crucial error in section 3.

This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.

This paper has been withdrawn by the author due to a serious mistake on Lemma 2.4.

This paper has been removed by the author due to a misstatement in Theorem 1 and a gap in its proof. A corrected and largely extended successor (a joint work with Thomas Bauer and Tomasz Szemberg) can be found under math.AG/0312211,

This paper has been withdrawn by the author due to a crucial error.

This paper has been withdrawn by the authors due to an error.

This paper has been withdrawn by the author due to an error in the data-analysis.

We show a near optimal direct-sum theorem for the two-party randomized communication complexity. Let $f\subseteq X \times Y\times Z$ be a relation, $\varepsilon> 0$ and $k$ be an integer. We show,…

This document is withdrawn due to an error in Lemma 4.

This paper has been withdrawn by the authors due to the fact that the conjecture has indeed already long been established.