Linde Institute/SISL Seminar: Aviad Rubenstein, UC Berkeley

Wednesday November 30, 2016 12:00 PM

Hardness of Approximation between P and NP

Speaker: Aviad Rubenstein, UC Berkeley
Location: Baxter B125

The first question we computer scientists ask when facing a new algorithmic challenge is: is it NP-hard, or is it in P? Surprisingly, for many important problems, the answer is "neither!" Rubenstein will discuss recent progress towards understanding the complexity of those problems.

Series Linde Institute/Social and Information Sciences Laboratory Seminar Series (SISL)

Contact: Sheryl Cobb at x4220 sjc@hss.caltech.edu