CS 6520 - Computational Complexity Fall 2015
Friday, September 25, 2015
Lecture 17
Assignment 2 posted on T-Square due October 5 at 5 PM
Probabilistic Complexity Classes:
PP
,
BPP
,
RP
and
ZPP
.
Can assume error is 1-2^{q(n)} for any polynomial q
Showed NP in PP, RP in BPP in P/poly
HW to show ZPP = RP ∩ co-RP
Newer Post
Older Post
Home