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

• Type: Journal
• Year: 2010
• Where: TOC
• Authors: Navin Goyal, Michael Saks
• Keywords: Management, Noisy Comparison Tree, Noisy Computation, Noisy Parallel Decision, TOC 2010