CS 6520 - Computational Complexity Fall 2015
Friday, October 16, 2015
Lecture 25
Assignment 3 has been posted on T-Square. Due on Monday, October 26 at 5 PM.
Valiant-Vazirani to show NP in BPP
⊕P
⊕P = ⊕P
⊕P
(
Papadimitriou-Zachos
)
The first part of
Toda's theorem
that the polynomial-time hierarchy is in BPP
⊕P
Newer Post
Older Post
Home