Sciweavers

Share
TOC
2010

Rounds vs. Queries Tradeoff in Noisy Computation

8 years 8 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational Complexity, 2004, 113
Navin Goyal, Michael Saks
Added 22 May 2011
Updated 22 May 2011
Type Journal
Year 2010
Where TOC
Authors Navin Goyal, Michael Saks
Comments (0)
books