Computational Complexity Course Fall 2010
Friday, October 1, 2010
Lecture 5
Scribe Notes
by David Barbella
Topics: Polynomial-Time Hierarchy, P/poly
Papers Mentioned:
Karp-Lipton
: PH collapses to second level if NP in P/poly
Buhrman-Hitchcock
: PH collapses to third level if there are subexponential-sized NP-complete sets
1 comment:
Tom Hayden
October 3, 2010 at 6:35 PM
Thanks for posting these, Lance!
Reply
Delete
Replies
Reply
Add comment
Load more...
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
Thanks for posting these, Lance!
ReplyDelete