Question: Let A be a polynomial-time one-sided error Monte Carlo algorithm that decides a language L so that on every string x, if x L then
Let A be a polynomial-time one-sided error Monte Carlo algorithm that decides a language L so that on every string x, if x L then A returns the answer yes with probability 0.5; if x / L then A returns the answer no with probability 1. Describe a polynomial-time randomized algorithm B that uses A (as a subroutine) to decide L with probability of success at least 0.9.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
