A strong XOR lemma for information complexity: computing f^{⊕n} with constant error costs Ω(n) times the information needed to compute f with error 1/n, up to vanishing additive terms.
Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Strong XOR Lemma for Information Complexity
A strong XOR lemma for information complexity: computing f^{⊕n} with constant error costs Ω(n) times the information needed to compute f with error 1/n, up to vanishing additive terms.