New answers tagged check-my-answer
0
votes
Accepted
Show that there is also a randomized polynomial-time decider $M'$ for $L$ such that $w\in L \Rightarrow Pr[M(w)=1] > 0.99$
Since the decider $M$ has no false positive, there is no need for Chernoff bound. Consider $M'$ defined as follow:
run $M(x)$ $n$ times;
if $M$ returns $1$ at least once, then $M'$ returns $1$;
...
Top 50 recent answers are included
Related Tags
check-my-answer × 134algorithms × 22
regular-languages × 15
proof-techniques × 14
formal-languages × 13
complexity-theory × 11
computability × 11
correctness-proof × 11
pumping-lemma × 10
graphs × 9
finite-automata × 9
asymptotics × 9
recurrence-relation × 9
turing-machines × 6
time-complexity × 6
context-free × 6
np-complete × 6
algorithm-analysis × 5
automata × 5
formal-grammars × 4
regular-expressions × 4
np × 4
runtime-analysis × 3
sorting × 3
undecidability × 3