National Science Foundation
Mathematical Sciences Institutes
Home
Institutes
Events
Highlights
Videos
Diversity
About
Videos
Exponential-time algorithms for NP problems: prospects and limits
Presenter
Andrew Drucker
October 4, 2013
IAS
Play Video
Abstract
Exponential-time algorithms for NP problems: prospects and limits
Supplementary Materials
Drucker - IAS.pdf