Say I have a randomized algorithm for a yes/no problem. Each time I run the algorithm,I have
Fantastic news! We've Found the answer you've been seeking!
Question:
Say I have a randomized algorithm for a yes/no problem. Each time I run the algorithm,I have a 3/4 probability of outputting the correct answer. Use Chebyshevs inequality to show that if I run the algorithm 2k + 1 times and output the majority answer, the probability that I output the wrong answer is at most c/k for some constant c.
Posted Date: