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
Posted by Lance Fortnow at 1:03 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Information

  • Student Presentations
  • Course Overview
  • Scribe Style File
  • Sample Lecture LaTeX

Blog Archive

  • ▼  2015 (33)
    • ►  April (1)
    • ▼  March (10)
      • Lecture 32
      • Lecture 31
      • Lecture 30
      • Lecture 29
      • Lecture 28
      • Lecture 27
      • Lecture 26
      • Lecture 25
      • Lecture 24
      • Lecture 23
    • ►  February (11)
    • ►  January (11)
  • ►  2014 (1)
    • ►  December (1)
Simple theme. Powered by Blogger.