Linde Institute/SISL Seminar: Aviad Rubenstein, UC Berkeley
Hardness of Approximation between P and NP
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.
Contact: Sheryl Cobb at x4220 email@example.com