/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q11P Let聽M be a probabilistic polyno... [FREE SOLUTION] | 91影视

91影视

LetM be a probabilistic polynomial time Turning machine, and let C be a language where for some fixed0<1<2<1,

  1. localid="1657794094101" wCimplies Pr[ M accepts w], localid="1657794117156" 1and
  2. localid="1657794100896" wCimplies Pr[ M accepts w] localid="1657794105827" 2.
  3. Show that localid="1657794108596" CBPP.(Hint: Use the result of Lemma 10.5)

Short Answer

Expert verified

By the weak law of large numbers (or various other bounds from probability theory), there exist k that will make those probabilities on the right as small as desired, and in particular, there exist k that will make them both strictly less than 12 and by using 鈥淎mplification lemma鈥 this shows CBPP.

Step by step solution

01

Understanding the given problem

Given M be probabilistic polynomial time Turning machine, and C be a language where for some fixed ,

  1. wCimplies Pr[ M accepts w] 1,
  2. wCimplies Pr[ M accepts w] 2.
02

To show C∈BPP

  • Between any two distinct real numbers <1<2, there exists another real number that lies strictly between them. Thus, choose c such that<1<2
  • Consider another machine S which repeatedly runs M. Now S accepts if the proportion of M鈥檚 acceptance is greater than or equal to c, and S rejects if the proportion of M鈥檚 acceptance is less than c.
  • To show S decides in BPP, Consider the variable Skbe the total number of acceptances by machine M after k runs on input w. Hence for wC,Skis the sum ofk0-1 random variables with common mean >2, and for wC,Sk, is the sum of k0-1random variables with common mean >1.
03

Expressing the Error Probabilities

  1. For wC,Pr[S rejects w]=localid="1657793586246" Pr[Skk<c]Pr|Skk-2|>2-c]
  2. For wC,Pr[S accepts w]= localid="1657794124662" Pr[Skkc]Pr|Skk-1|c-1]
  • By using 鈥淎mplification lemma鈥 this shows CBPP.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.