Linde Institute/SISL Seminar: Aviad Rubenstein, UC Berkeley
Baxter B125
Hardness of Approximation between P and NP
Aviad Rubenstein,
Computer Science PhD Candidate,
UC Berkeley,
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.
For more information, please contact Sheryl Cobb by phone at x4220 or by email at [email protected].