SlidesbyGolanWeisz,OmerBenShalomNirAilonTal.pptVIP

In This Lecture The non-uniform polynomial time class (P/Poly) The two equivalent definitions for the class The power of P/Poly BPP is contained in P/Poly P/Poly includes non recursive languages What is P/Poly? P/Poly comprise all languages accepted by TMs working with an external “advice” Formally - L?P/Poly if there exists a polynomial time two-input machine M and a sequence {an} of “advice” strings |an|?p(n) s.t What is P/Poly? P/Poly as Circuits ? An alternative def: For L in P/Poly there is a sequence of circuits {Cn}, where Cn has n inputs and 1 output, its size is bounded by