CS 8803 COR - Complexity of Randomness
Spring 2015
Friday, March 6, 2015
Lecture 25
NEXP in P/poly iff NEXP = EXP = MA
In search of an easy witness: exponential time vs. probabilistic polynomial time
by Impagliazzo, Kabanets and Wigderson
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment