A Sampling Technique of Proving Lower Bounds for Noisy Computations
C Dutta, J Radhakrishnan - arXiv preprint arXiv:1503.00321, 2015 - arxiv.org
We present a technique of proving lower bounds for noisy computations. This is achieved by
a theorem connecting computations on a kind of randomized decision trees and sampling …
a theorem connecting computations on a kind of randomized decision trees and sampling …
How Hard is Computing Parity with Noisy Communications?
We show a tight lower bound of $\Omega (N\log\log N) $ on the number of transmissions
required to compute the parity of $ N $ input bits with constant error in a noisy …
required to compute the parity of $ N $ input bits with constant error in a noisy …